数据结构 集合与查找详细解析.ppt

9 Insert 9 5 5 6 30 40 16 17 2 Insert an index entry 2 plus a pointer into parent. 2 3 1 16 30 * Insert Now, insert a pair with key = 18. 9 1 2 5 5 6 30 40 9 16 17 16 30 2 3 * Insert Now, insert a pair with key = 18. 9 1 2 5 5 6 30 40 9 16 30 2 3 16 17 17 18 Insert an index entry17 plus a pointer into parent. * Insert Now, insert a pair with key = 18. 9 1 2 5 5 6 2 3 Insert an index entry17 plus a pointer into parent. 9 16 16 17 18 30 40 17 30 * Insert Now, insert a pair with key = 7. 1 2 5 5 6 2 3 9 16 16 17 18 30 40 30 9 17 * Delete Delete pair with key = 16. 9 1 2 5 5 6 30 40 9 16 17 16 30 2 3 Note: delete pair is always in a leaf. * Delete Delete pair with key = 16. 9 1 2 5 5 6 30 40 9 16 30 2 3 Note: delete pair is always in a leaf. 17 * Delete Delete pair with key = 1. 9 1 2 5 5 6 30 40 9 16 30 2 3 17 Get = 1 from sibling and update parent key. * Delete Delete pair with key = 1. 9 2 3 5 5 6 30 40 9 16 30 17 Get = 1 from sibling and update parent key. 3 * Delete Delete pair with key = 2. 9 2 3 5 5 6 30 40 9 16 30 17 Merge with sibling, delete in-between key in parent. 3 * Delete Delete pair with key = 3. 9 3 5 6 30 40 9 16 30 17 Get = 1 from sibling and update parent key. 5 * Delete Delete pair with key = 9. 9 5 30 40 9 16 30 17 Merge with sibling, delete in-between key in parent. 6 6 * Delete 9 5 30 40 17 6 6 30 * Delete Delete pair with key = 6. 9 5 30 40 9 16 30 17 Merge with sibling, delete in-between key in parent. 6 6 * Delete Index node becomes deficient. 9 5 30 40 9 16 30 17 Get = 1 from sibling, move last one to parent, get parent key. * Delete Delete 9. 16 5 30 40 9 30 17 Merge with sibling, delete in-between key in parent. 9 * Delete Index node becomes deficient. 16 5 30 40 30 17 Merge with sibling and in-between key in parent. * Delete Index node becomes deficient. 5 30 40 17 It’s the root; disc