本文给出了在二叉前序线索树中消除困难访问的填左局部根算法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.
同时根据二叉树的前序遍历结果匹配血管段，有效地提高了匹配的速度和准确度。
Vessel segments in two images are matched by the preorder traversal of the binary trees, and the method is proved fast and accurate.
说明：二叉树操作：建立二叉树，前序遍历二叉树、中序、后序遍历二叉树。
Binary tree operation: create a binary tree, before traversing binary, inorder, postorder binary tree traversal.
给定一个二叉树的前序和中序遍历，重建这棵二叉树。
Given preorder and inorder traversal of a tree, construct the binary tree.
输入树的前序遍历结果和中序遍历结果建立起这棵树并给出后序遍历结果。
Enter the tree traversal Preorder traversal of the results and the results of established tree and gives the results after the traversal.
输入树的前序遍历结果和中序遍历结果建立起这棵树并给出后序遍历结果。
Enter the tree traversal Preorder traversal of the results and the results of established tree and gives the results after the traversal.
应用推荐