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

9 查阅

●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

参考答案:

A【解析】前序遍历一个二叉树等价于按从树的根部、右子树、右子树查找顺序查找树。

软考初级