題組內容
Ⅰ.(45% ) Consider the following keys: 2, 4, 26, 25, 13, 14, 51, 9, 17, 43, 68
申論題內容
3. (15%) Insert the keys into an AVL tree one by one. Reconstruct the AVLL tree when it violates the AVL
property (for all node v, I v.leftsubtree height - v .rightsubtree.height I <=1 ). Show each step and the final
result.