A-A+

Traversing a binary tree in preorder is equiva

2022-08-06 03:45:20 问答库 阅读 175 次

问题详情

Traversing a binary tree in preorder is equivalent to(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
解析:前序遍历一个二叉树等价于按从树的根部、右子树、右子树查找顺序查找树。

考点: