試卷名稱:110年 - 110 國立臺灣大學_碩士班招生考試_部分系所:資料結構(B)#102892
年份:110年
科目:台大◆電機◆資料結構(B)
17. Which of the following statements are true?
(A) An insertion in AVL tree requires Ω(logn) single- and double-rotations in the worst case.
(B) An insertion in AVL tree requires O(1) single- and double-rotations in the worst case.
(C) A deletion in AVL tree requires Ω(logn) single- and double-rotations in the worst case.
(D) A deletion in AVL tree requires O(1) single- and double-rotations in the worst case.
(E) There is no red left child in AA tree.