本文提出了二叉线索树中的准相连、局部根、局部路径概念。
In this paper, some new concepts in threaded binary trees, such as supple-links, local-root and local path are presented.
把线索二叉树和本文改进的前推法结合起来形成了一种新的辐射状配电网潮流计算方法。
A new method of power flow is coming into being when combining threaded binary tree and forward sweeping method.
比较的结果表明，新算法所生成的线索二叉树比传统的先序和后序线索二叉树优越。
Results of comparison show that the threaded binary-trees generated by the new method are more efficient than the traditional ones.
本文给出了在二叉前序线索树中消除困难访问的填左局部根算法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.
新算法生成的线索二叉树比传统的线索二叉树优越，从而使WBS搜索更加简单、有效。
The threaded binary tree based on the new algorithm is superior to the traditional one, and thus makes the WBS searching simpler and more effectual.
给出了消除二叉后序线索树中困难访问的算法。
Finally algorithms for removing difficult visitable in postorder threaded binary trees are given.
给出了消除二叉后序线索树中困难访问的算法。
Finally algorithms for removing difficult visitable in postorder threaded binary trees are given.
应用推荐