本文给出了在二叉前序线索树中消除困难访问的填左局部根算法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.

youdao

研究了齐次树指标可列马氏链的一类强极限定理。

We establish the strong limit theorem for countable Markov chains indexed by a homogeneous tree.

youdao

给出二叉树坐标网的定义及其基本定理。

This article presents the define of the binary tree coordinate net and its basic theorems.

youdao