第5章集合与查找.pptVIP

下载本文档

1
0
约3.27万字
约 176页
2017-07-17 发布于四川
举报
版权申诉

第5章集合与查找.ppt

1、本文档共176页，可阅读全部内容。
2、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。
3、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
5、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
6、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
7、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
8、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

第5章集合与查找

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