問題詳情
【題組】(2) Which statement(s) is correct for an AVL tree?
(A) The absolute value of the level difference ofany two leaves is at most one.
(B) The absolute value of the height difference of any two subtreeson the same level is at most one.
(C) A deletion needs at most two rotation operations to preservean AVL tree to be a height-balanced tree.
(D) After a new node is inserted, the tree height will notincrease if rotation operations are performed.
參考答案
答案：[無官方正解]
難度：計算中-1
書單：沒有書單，新增