相关文档

《算法入门》(英文版)Lecture 10 Prof. Erik Demaine

Balanced search tree: A search-tree data structure for which a height of O(lg n) is guaranteed when implementing a dynamic set of n items.
团购合买资源类别:文库,文档格式:PDF,文档页数:29,文件大小:251.95KB
点击进入文档下载页(PDF格式)
共29页,试读已结束,阅读完整版请下载
点击下载(PDF格式)

浏览记录