資料結構›Ch9 進階樹
第 73 題/共 88 題
◀ DS 73/88
73. AVL Tree、樹重新平衡
#DS-09-073易AVL Tree樹重新平衡

[5%] Given an AVL tree as follows, we perform the operations (A), (B), (C), (D) and (E), independently. Which of these operations would result in the tree to be unbalanced, and shall be restructured?

題目附圖
📄 成大112
跳轉到第題
▤完整推導請見《WH 資工筆記 · 資料結構》Ch9 進階樹
本章題號 · 61–80 / 88