問題詳情
39. Binary search tree (BST) stores keys in its nodes. Which of the followingstatements are true?
(A) For a binary search tree with n nodes, searching a key in BST takes O(log n)time in worst case.
(B) A binary search tree of height h has at most
nodes.
(C) Performing an inorder traversal on a binary search tree results in a sorted listof keys in ascending order.'
(D) AVL trees are also binary search trees.
(E) Given the preorder and inorder traversal sequences of a BST, we can re-construct a unique BST.
參考答案
答案：[無官方正解]
難度：計算中-1
書單：沒有書單，新增