说明：二叉树操作：建立二叉树，前序遍历二叉树、中序、后序遍历二叉树。
Binary tree operation: create a binary tree, before traversing binary, inorder, postorder binary tree traversal.
对二叉树的遍历过程进行深入地研究，提出一种生成二叉树遍历序列的新方法，解决了二叉树遍历序列的生成问题。
By careful researches of the traversal of binary tree, a new method of traversing binary tree is brought forward, which is able to solve the problem of traversal of binary tree.
本文将对满二叉树的结构进行深入分析，采用深度遍历与广度遍历两种途径给出递推关系式。
This paper goes deeply into such tree's structure using both depth search and breadth search, and gives recursive relationship separately.
同时根据二叉树的前序遍历结果匹配血管段，有效地提高了匹配的速度和准确度。
Vessel segments in two images are matched by the preorder traversal of the binary trees, and the method is proved fast and accurate.
二叉树遍历的非递归算法相对于递归算法，减少了函数调用等开销，具有性能优势。
Compared with recursive algorithm for binary tree traversing, non-recursive algorithm reduces expenses of function calls, gains performance advantage.
给定一个二叉树的前序和中序遍历，重建这棵二叉树。
Given preorder and inorder traversal of a tree, construct the binary tree.
但是不同的二叉树的先序遍历序列或中序遍历序列或后序遍历序列有可能是相同的。
The pre order, in order and post order traversal of every binary tree are unique, but those of different binary trees may be identical.
首先将一个服务的组合方案等效成AOV图，并将其转换成二叉树，然后进行后续遍历并编码。
The services composition plan was transferred into an AOV graph equivalently, and then was transformed into a binary tree further.
利用递归和非递归实现二叉树的中序遍历，利用队列实现二叉树的层次遍历。
Recursive and non recursive implementation of binary tree traversal, the use of queues to achieve the level of binary tree traversal.
先序遍历是序列化二叉树的方式之一。
One way to serialize a binary tree is to use pre-oder traversal.
即先用RSA方法加密密钥矩阵，然后用二叉树的遍历产生的不同密钥数据矩阵对数据进行加密。
First, produce key with RSA and construct a binary tree, then traverse the binary tree to produce new keys. And there must be a certain key to encrypt data with all the other encoding methods.
从完全二叉树的定义及性质出发，根据二叉树的层次遍历原则，提出了一种遍历法判断完全二叉树的方法。
In this paper, a new coding scheme was proposed, which was based on the sequence of its complete binary tree.
给定先序和中序遍历，构造二叉树。
Given preorder and inorder traversal of a tree, construct the binary tree.
给定先序和中序遍历，构造二叉树。
Given preorder and inorder traversal of a tree, construct the binary tree.
应用推荐