Which of the following is true? A) The height of a BST with n nodes is O(lgn). B) In a heap, heights of any two siblings differ by at most 2. C) Any subtree of an AVL tree is also an AVL tree. D) When we delete a node and then add the same node again, the AVL tree always becomes the same with its initial state