資料結構›Ch9 進階樹
第 33 題/共 88 題
◀ DS 33/88
33. B-Tree
#DS-09-033中B-Tree

(3%) After sequentially inserting the following numbers into an empty B-tree with max degree 3 (i.e, each node has at most 3 children),

80,40,20,100,60,30,50,70,10,25,3580, 40, 20, 100, 60, 30, 50, 70, 10, 25, 35

how many nodes in the B-tree are of one number?

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