Ⅰ.(45% ) Consider the following keys: 2, 4, 26, 25, 13, 14, 51, 9, 17, 43, 68
申論題內容
1. (15%) Insert the keys into a min heap one by one. Reconstruct the heap when it violates the heap order
(for all node v, v.key ＞ v.parcnt.key). Show each step and the final result.
阿摩線上測驗
登入