(1) Which one of the following statements is always correct? Answer: ( (A) Given any binary search tree, if we remove the sub-tree rooted at the right child of the root, the remaining part of the tree forms a max-heap (B) A binary search tree with n nodes guarantees O(logn) time complexity for searching a key. (C) INORDER-TREE-WALK can be used to print out the keys of a binary search tree in sorted order. (D) With Open Addressing, when searching for a key, we have to go through all slots of the hash table (E) None of the above is always correct