資料結構›Ch9 進階樹
第 55 題/共 88 題
◀ DS 55/88
55. B-Tree、插入與刪除
#DS-09-055中B-Tree插入與刪除

Considering the following B-tree of order 4.

Successively insert 62, 5, 85, and 12 one at a time into the above B-tree and then delete 5, 50, 62, 85, and 10 one at a time. Please show the new tree after completing all the insertion and deletion operations.

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