資料結構›Ch9 進階樹
第 27 題/共 88 題
◀ DS 27/88
27. AVL Tree、Insert
#DS-09-027中AVL TreeInsert

Consider an AVL tree that results from successively inserting keys 2, 4, 5, 3, 8, 7, 1, 6, 9 into an initially empty tree. Which of the following statements are true?

📄 台大110
跳轉到第題
▤完整推導請見《WH 資工筆記 · 資料結構》Ch9 進階樹
本章題號 · 21–40 / 88