摘要
阐述了一种改进自Trie树的新型数据结构,支持对整数集的各种动态统计操作,该结构容易实现,并且有着简明的定义和令人惊叹的运行速度,以及简单的正确性和时间效率证明。
This paper presents a new type of data structure to improve the Tile Tree. It supports the operations of dynamic statistics on the integer set, such as insert, search, delete, etc. It is very easy to implement and has a straightforward description and a surprisingly simple proof of correctness and runtime.
出处
《软件导刊》
2009年第7期14-16,共3页
Software Guide
基金
上海师范大学大学生创新项目(CH023)