阿摩線上測驗
登入
阿摩線上測驗
登入
試卷名稱：104年 - 104 國立交通大學_碩士班考試入學試題_資訊聯招：資料結構與演算法#113199
年份：104年
科目：研究所、轉學考(插大)◆資料結構與演算法
9. A max-heap is given below； the numbers at the nodes are their keys. Now after one insertion operation (the
number inserted is 14) and then one deletion operation, which of the following statements is false
regarding the resulting heap? Here node (n) represents the node with key n.
(A) The parent of node (4) is node (11).
(B) node (13) has two children.
(C) The position of node (10) in the tree does not change.
(D) node (17) is the root.
(E) The number of leaf nodes does not change.
