試題詳解

2. Which of the following statemnents about n-element AVL trees are false?
(A) The time complexity of deleting element with key k is O(1).
(B) The time complexity of insertion is O(log n).
(C) If the AVL tree has height = h, then n >=, where Fittl is the Fibonacci numbet, i e.，
(D)h_L - b_R should be O, where hi, and hr denote the height of the left subtree and the right subtree, respectively.