Binary Search Tree¶

单选题¶

2-2

Given the structure of a binary search tree (as shown in the figure), which one of the following insertion sequences is impossible?
- A. 83 67 91 98 20 75
- B. 83 67 75 91 20 98
- C. 83 91 75 67 20 98
- D. 83 91 98 67 75 20
Solution 2-2

2-5

Among the following binary trees, which one can possibly be the decision tree (the external nodes are excluded) for binary search?
- A.
- B.
- C.
- D.
Solution 2-5

似乎决策树的概念上课没讲过

 一个98帖子的解答：偏向的策略要一致，“每个节点都保证左不少于右，或者每个节点都保证左不多于右”。