●Traversing a binary tree in preorder is equivalent to (68) ．(68) A．Traversing the forest corresponding to the binary tree in root-first orderB．Traversing the forest corresponding to the binary tree in root-last orderC．Traversing the forest corresponding to the binary tree in breadth-first orderD．None of the above
●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
相关考题：
14、二叉树的先序遍历的递归实现如下： template＜class T＞ void BinaryTree＜T＞::PreOrder （BinaryTreeNode＜T＞ *root) { if （root != NULL) { ; } } 则中间部分应为：A．Visit(root-＞value());PreOrder(root-＞leftchild());PreOrder(root-＞rightchild());B．PreOrder(root-＞leftchild());Visit(root-＞value());PreOrder(root-＞rightchild());C．PreOrder(root-＞rightchild());Visit(root-＞value());PreOrder(root-＞leftchild());D．PreOrder(root-＞leftchild());PreOrder(root-＞rightchild());Visit(root-＞value());
7、面心立方、体心立方和密排六方的致密度分别为？A．74％、68％、74％B．74％、74%、74%C．68％、68%、68%D．68％、74%、68%