An Efficient Tree Generation Algorithm
In this paper, an efficient tree generation algorithm based on prefix code is proposed. The algorithm utilizes the sequence consistency of the database record set and the preorder traversal tree. It only need to query on the database and traversal the tree nodes one time respectively, then all nodes can be added to the tree one by one. There is only one cycle that is the traverse of the tree nodes collection, so the time complexity of the algorithm is O (n). Experimental results show that the tree nodes and their child nodes can be queried and stated rapidly.
prefix tree tree generation algorithm preorder traversal
Zhan-Fen Li Li-Qun Kuang
Department of Continuing Education, Taiyuan Institute of Technology Taiyuan, Shanxi, China, 030008 School of Electronics and Computer Science and Technology, North University of China Taiyuan, Shanxi
国际会议
太原
英文
575-578
2010-10-22（万方平台首次上网日期，不代表论文的发表时间）