資料結構›Ch9 進階樹第 56 題／共 88 題
56. Symmetric Min-Max Heap、SMMH
#DS-09-056中Symmetric Min-Max HeapSMMH
題組題幹（本題：(c)，共 3 小題）點擊展開
Considering the data pairs with keys in the given order: 20, 5, 10, 18, 4, 22, 11, 32, 21, as inputs to create a tree.
Note: In a tree, each step from top to bottom is called as level of a tree. The level count starts with 1 and increments by 1 at each level or step.
[3%] If you create a symmetric min-max heap for them, which of the following statements is true?
📄 成大113
▤完整推導請見《WH 資工筆記 · 資料結構》Ch9 進階樹