论文部分内容阅读
提出了一种新的表示树的存储结构．该结构便于实现树的各种操作，并使寻找给定结点的父结点等基本操作的时间复杂度达到０（１），使树的遍历操作不再需要任何辅助空间．
A new presentation tree storage structure is proposed. The structure facilitates various operations of the tree and achieves a time complexity of 0 (1) for basic operations such as finding the parent node of a given node so that the tree traversal operation no longer requires any auxiliary space.