改进的前序遍历树模型 The Nested Set Model
本文给出了在二叉前序线索树中消除困难访问的填左局部根算法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.
应用推荐