This control can be used in studying of binary and other types of trees.
这种控制可用于二进制的树木和其他类型的研究。
In this paper, algorithm f, which can fill in left local root on preorder in-threaded binary trees, and other related theorems, definitions and algorithms are presented.
本文给出了在二叉前序线索树中消除困难访问的填左局部根算法f。其他有关的定理、定义及算法也一并附出。
In this paper, algorithm f, which can fill in left local root on preorder in-threaded binary trees, and other related theorems, definitions and algorithms are presented.
本文给出了在二叉前序线索树中消除困难访问的填左局部根算法f。其他有关的定理、定义及算法也一并附出。
应用推荐