複選題
16. Which of the following are balanced search trees?
(A) Binary search tree
(B) Red-black tree
(C) AVL tree
(D)2-3-4 tree
(E) Splay tree

複選題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.

複選題18. Consider an AVL tree that results from successively inserting keys 2, 4, 5, 3, 8, 7, 1, 6, 9 into an initially empty tree. Which of the following statements are true? (A) The tree height is 4. (B) Key 3 and key 5 have the same depth. (C) Key 2 and key 8 have the same height. (D) Key 6 is a icaf. (E) Key 7 is the parent of key 9.

複選題19. Consider the splay tree in Figure 1. Which of the following statements are true? (Assume bottom-up splay, also assume the Join0 operation splays on the maxim mum element in the left tree, which then attaches the right tree.)(A)In Figure 1, after deleting key 26, then key 33 is a child of key 48. (B) In Figure 1, after deleting key 26, then key 17 is the root. (C) In Figure 1, after inserting key 75, then key 64 is an ancestor of key 99. (D)In Figure 1, after inserting key 75, then key 33 is a descendant of key 5S. (E) In Figure 1, after inserting key 75, then key 75 is the root.

複選題20. Consider the red-black tree in Figure 2, which of the following statements are true? (Assume bottom-up insertion/deletion) (A) In Figure 2, after inserting key 14, then there are 6 red nodes. (B) In Figure 2, after inserting key 54, then key 49 and key 54 are siblings. (C) In Figure 2, after deleting key 22, then key 25 and key 73 are siblings. (D) In Figure 2, after deleting key 66, then key 35 is red. (F) In Fignre 2, after deleting key 83, then key 89 is red.

複選題21. Consider an AA tree that results from successively inserting keys 96, 49, 79, 14, 41, 87, 75, 90 61 into an initially empty tree. Which of the following statements are true? (A) The root is key 61. (B) There is less than 3 horizontal links. (C) Key 41 and key 49 are in the same level. (D) Key 87 and key 96 are siblings. (E) Key 14 is the parent of key 41.

複選題22. Consider a min-heap. Which of the following statements are true? (A) For any subtree of a min-heap, the root ol the subtree contains the smallest key occurring anywhere in that subtree. (B) An array that is in ascending order is a binary min-heap. (C) The sequence [1,5,6,7.14, 17,10,23, 13,12] is a binary min-heap. (D) The largest key muust in a leaf (E) The smallest key must reside in a leaf I reside in

複選題23. Consider a Fibonacci heap that results from successively inserting 929 (distinct) keys into an initially empty heap, followed by deleting the minimum key. Which of the following statements are true?(A) The Fibonacci heap is of degree 9.(B) The Fibonacci heap is of height 12.(C) There are 5 trees in the Fibonacci heap.(D) With one additional decrease key operation, the Fibonacci heap can have 6 trees.(E) With two additional decrease key operations, the Fibonacci heap can have 7 trees.

複選題24. Which of the following are desirable properties of a hash function h(x)?  (A) If x1 ,.., xn are the items to be hashed, then the numbers h(x1),.... h(xn) should be uniformly distributed over the integers. (B) The range of h(x) should include a wide range of integers. (C) The range of h(x) should stay within the desired hash-table size. (D) It should be computable in O(1) time. (E) It should take distinct values over all possible items to be hashed.

1.「悲天憫人」是由「動詞＋名詞＋動詞＋名詞」的方式構成的，下列何者與此相同？ (A)群山萬壑 (B)粗枝大葉 (C)國泰民安 (D)開天闢地

2.下列「」中詞語的意思，何者與其他三者不同？ (A)約莫再過「一旬」，這盆曇花就要綻放 (B)天色變暗，「不一會兒」就下起大雨來 (C)「彈指」之間，弟弟已到入伍的年齡了 (D)下課鐘一響，「霎時」教室就空無一人

110年 - 110 國立臺灣大學_碩士班招生考試_部分系所:資料結構(B)#102892

109年 - 109 國立臺灣大學_碩士班招生考試_電機工程研究所丙組:資料結構(B)#105932