摘要
计算机科学中最基本的问题就是如何高效的存储、组织数据,以实现快速的查找、更新等操作。本文对二叉树和堆结构进行了简单的回顾,分析了普通和随机Treap数据结构的特点,指出了它的局限性和不足。
The most basic problem in computer science is how to store and organize the data efficiently, in order to do fast find, renew operation,etc. This paper reviews the binary search tree and heap structure simply,and primarily analyzes the common and randomized treap data structure ,and points out its limitation.
出处
《计算机应用与软件》
CSCD
北大核心
2005年第8期36-38,共3页
Computer Applications and Software
