Traversing a binary tree in preorder is equivalent to (68) ．(68)

A．Traversing the forest corresponding to the binary tree in root-first order

B．Traversing the forest corresponding to the binary tree in root-last order

C．Traversing the forest corresponding to the binary tree in breadth-first order

D．None of the above

[单选题]Traversing a binary tree in preorder is equivalent toA．Traversing the forest corresponding to the binary tree in root-first order.B．Traversing the forest corresponding to the binary tree in root-last order.C．Traversing the forest corresponding to the

[单选题]Which traversal method for a binary tree does the following Pascal code illustrate? procedure traverse (p:pointer); begin if p<>nil then begin traverse(p ↑ .left); process(p); traverse(p ↑ .right); end end;A．preorderB．postorderC．reorderD．inorde

[单选题]Which traversal method for a binary tree does the following Pascal code illustrate? Procedure traverse(p：pointer)； Begin Ifp<>NIL Then begin Traverse (p^．left)； Process(p)； Traverse(p^．right) End； End_A．pre_orderB．middle_orderC．noneD．last_order

[单选题]Suppose a given binary tree has 10 leaf nodes, the number of nodes with degree of 2 isA．12B．11C．9D．Indeterminable

[单选题]Suppose a given binary tree has 10 left nodes，then the number of nodes with degree of 2 isA．12B．11C．9D．Indeterminable

[单选题] 对于二叉查找树（Binary Search Tree） ，若其左子树非空，则左子树上所有结点的值均小于根结点的值；若其右子树非空，则右子树上所有结点的值均大于根结点的值；左、右子树本身就是两棵二叉查找树。因此，对任意一棵二叉查找树进行 （61） 遍历可以得到一个结点元素的递增序列。在具有 n 个结点的二叉查找树上进行查找运算，最坏情况下的算法复杂度为 （62） 。（61）A． 先序B． 中序C． 后序D． 层序（62）A． O(n2B． O(nlog2n)C． O(log2n)D． O(n)

[单选题]对于二叉查找树(Binary Search Tree)，若其左子树非空，则左子树上所有结点的值均小于根结点的值；若其右子树非空，则右子树上所有结点的值均大于根结点的值。左、右子树本身就是两棵二叉查找树。因此，对任意一棵二叉查找树进行(61)遍历可以得到一个结点元素的递增序列。在具有n个结点的二叉查找树上进行查找运算，最坏情况下的算法复杂度为(62)。A．先序B．中序C．后序D．层序

[单选题]What is the decimal value of the binary value 10010？ (70) .(70) A．18B．20C．14D．15

[单选题]What is the decimal value of the binary value 10010？A．16B．17C．18D．19

[名词解释] 树（tree）