在数据库上实现一种高效显示的任意树形结构

The realization of high efficiently displaying the tree structure in the database

根据树形结构的显示特征和线索二叉树的访问顺序,提出了一种新的表结构用来保存树,并在此表结构的基础上提出了新的树形结构显示算法,同时给出了增减节点以及求某个节点的所有子孙节点的算法。

According to the displaying character of the tree structure and the access sequence of threaded binary tree,a new table structure to save the tree is introduced. Based on the new table structure,a new algorithm to display tree structure is carried out, at the same time, the algorithm to add or delete the tree node and to search all of the child-nodes is given.