首页 | 本学科首页   官方微博 | 高级检索  
     


The analysis of a fringe heuristic for binary search trees
Authors:Patricio V Poblete  J.Ian Munro
Affiliation:Department of Computer Science, University of Chile, Blanco Encalada 2120, Santiago, Chile;Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1
Abstract:A detailed analysis is presented for the behaviour of binary search trees built by using a heuristic that performs only local reorganizations at the bottom of the tree.
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号