卷別
資料結構與演算法
選擇國立臺灣大學 2023 · 考試 · 第 6 題
考科資料結構
(5 points) The following is a binary tree and the alphabet on the node is simply the "name" (instead of value) of the node. Please select the correct statements from the following:
樹結構(節點以名稱標示):
A:左子B、右子CB:左子D、右子EC:左子F、右子GD:右子HE:右子IF:左子JG:左子K、右子LL:右子M
- (A)The successor of node B is E.
- (B)The successor of node A is C.
- (C)The tree is not a AVL tree.
- (D)If we remove node J, the result is an AVL tree.
- (E)If we remove node H, the result is an AVL tree.