資料結構›Ch9 進階樹第 42 題／共 88 題
42. B-Tree、Insertion
#DS-09-042中B-TreeInsertion
- Consider a B-tree with minimum degree of 3. Keys in the same node are stored in ascending order. The median key is used to split a full node. Initially the B-tree is empty. We then build the B-tree by inserting the keys 5, 6, 4, 2, 1, 7, 8, and 10 one by one in the given order. The following statements are independent from each other and all start from the same tree. Which of the following statement(s) is(are) true?
📄 交大110
▤完整推導請見《WH 資工筆記 · 資料結構》Ch9 進階樹