MarkAllenWeiss数据结构与算法分析课后习题答案12388.pdf
《MarkAllenWeiss数据结构与算法分析课后习题答案12388.pdf》由会员分享,可在线阅读,更多相关《MarkAllenWeiss数据结构与算法分析课后习题答案12388.pdf(1页珍藏版)》请在淘文阁 - 分享文档赚钱的网站上搜索。
1、Chapter 12:Advanced Data Structuresand Implementation12.3Incorporate an additional field for each node that indicates the size of its subtree.Thesefields are easy to update during a splay.This is difficult to do in a skip list.12.6If there are B black nodes on the path from the root to all leaves,it
2、 is easy to show byinduction that there are at most 2Bleaves.Consequently,the number of black nodes on apath is at most log N.Since there cant be two consecutive red nodes,the height isbounded by 2log N.12.7Color nonroot nodes red if their height is even and their parents height is odd,and blackothe
- 配套讲稿:
如PPT文件的首页显示word图标,表示该PPT已包含配套word讲稿。双击word图标可打开word文档。
- 特殊限制:
部分文档作品中含有的国旗、国徽等图片,仅作为作品整体效果示例展示,禁止商用。设计者仅对作品中独创性部分享有著作权。
- 关 键 词:
- MarkAllenWeiss 数据结构 算法 分析 课后 习题 答案 12388
限制150内