更多"Which traversal method for a binary"的相关试题:
[单项选择]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. preorder
B. postorder
C. reorder
D. inorder
[单项选择]
对于二叉查找树(Binary Search Tree)，若其左子树非空，则左子树上所有节点的值均小于根节点的值：若其右子树非空，则右子树上所有节点的值均大于根节点的值；左、右子树本身就是两棵二叉查找树。因此，对任意一棵二叉查找树进行 (58) 遍历可以得到一个节点元素的递增序列。在具有n个节点的二叉查找树上进行查找运算，最坏情况下的算法复杂度为 (59) 。
（58）处填（）。
A. 先序
B. 中序
C. 后序
D. 层序
[单项选择]
对于二叉查找树（Binary Search Tree），若其左子树非空，则左子树上所有结点的值均小于根结点的值；若其右子树非空，则右子树上所有结点的值均大于根结点的值；左、右子树本身就是两棵二叉查找树。因此，对任意一棵二叉查找树进行 （61） 遍历可以得到一个结点元素的递增序列。在具有n 个结点的二叉查找树上进行查找运算，最坏情况下的算法复杂度为（62） 。
（61）处填（）。
A. 先序
B. 中序
C. 后序
D. 层序
[填空题]Which train does he take
[单项选择]Which floor does Mary live on
A. The fourteenth floor.
B. The sixteenth floor.
C. The fifteenth (第十五) floor.
[单项选择]Which sport does the woman like
A. In the park.
B. Between two buildings.
C. In his apartment.
D. Under a huge tree.
[单项选择]Which language does Mary speak well
A. Chinese.
B. French.
C. Japanese.
D. English.
[单项选择]Which floor does Linda live on
A. Addison and Bush liked to meet friends.
B. Addison and Bush had many friends.
C. Addison and Bush have become good friends.
