阿摩線上測驗
登入
首頁
>
台大◆電機◆資料結構(B)
>
110年 - 110 國立臺灣大學_碩士班招生考試_部分系所:資料結構(B)#102892
> 試題詳解
複選題
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
答案：
登入後查看
統計：
尚無統計資料
詳解 (共 1 筆)
黎慶噎
B1 · 2021/11/03
#5190954
(B)(C)(D) 先了解Bala...
(共 183 字，隱藏中）
前往觀看
0
0
相關試題
Please choose the best possible answer in each of the following questions. In questions that ask for time complexities, please choose the tightest bound. 1. Consider the following five recursive functions: (A)(B) (C)(D)(E) Which recursion yields the highest asymptotic complexity for T(n)?
#2792816
2. For an AVL tree with 2021 nodes, let x be the minimum possible height, y be the maximum height, then (y-x) mod 5 is (A)0 (B) 1 (C)2 (D)3 (E) 4
#2792817
3.For a 2-3-4 tree of height 5, let x be the minimum possible size, y be the maximum possible size, then (xy) mod 5 is (A)0 (B)1 (C)2 (D)3 (E) 4
#2792818
4. For a binary heap of height 2021, let x be the minimun m possible size, y be the maximum possible size, then (3x+y) mod 5 is (A)0 (B)1 (C)2 (D)3 (E) 4
#2792819
5. Consider a binary heap that results from suc successively inserting keys 6, 3, 7, 8, 5, 1,2, 4, 9 into an initially empty heap. Then the depth of key 5 is (A)0 (B) 1 (C)2 (D)3 (E) None of above
#2792820
6. A binomial heap contains 2021 items. . How many among them have depth 7? (A)165 (B) 170 (C) 175 (D) 180 (E) 185 .
#2792821
7. If Dijkstra algorithm is implemented with Binomial heap as priority qucue, then the complexity is mplexity is (A)O(IVI2+E log IVI) (B)O(IVI2) (C)O(IEl log IVI) (D)O(|E|+|V| log|V|) (E) O(|E|)
#2792822
8. If Djjkstra algorithm is implem ented with Fibonacci heap as priority queue, then the con (A)O(IV|2+|E|log|V|)(B)O(|V|2) (C)O(|E|log|V|) (D)O(|E|+|VILog|VI) (E)O(|E|)
#2792823
9. If Dijkstra algorithm is implemented with binary heap as priority queue, then the complexity is (A)O(|V|2+|E|log|V|) (B)O(|V|2) (C)O(|E| log |V|) (D)O(|E|+|V|Iog|V|) (E)O(|E|)
#2792824
10. If Dijkstra algorithm is implemented with doubly-linked list as priority qucue, then the complexity is (A)O(|V|2+|E|log|V|)(B)O(|V|2) (C) O|E| log|V|)(D)O(|E|+|V|(log|V|) (E) O(|E|)
#2792825
相關試卷
110年 - 110 國立臺灣大學_碩士班招生考試_部分系所:資料結構(B)#102892
2021 年 · #102892
109年 - 109 國立臺灣大學_碩士班招生考試_電機工程研究所丙組:資料結構(B)#105932
2020 年 · #105932
阿摩線上測驗
登入
阿摩線上測驗
登入