Finally algorithms for removing difficult visitable in postorder threaded binary trees are given.

给出了消除二叉后序线索树中困难访问的算法。

youdao

In this paper, some new concepts in threaded binary trees, such as supple-links, local-root and local path are presented.

本文提出了二叉线索树中的准相连、局部根、局部路径概念。

youdao

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。其他有关的定理、定义及算法也一并附出。

youdao