複選題39. Binary search tree (BST) stores keys in its nodes. Which of the following statements 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 list of 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.