二叉树的遍历及其在排序中的应用

Binary Tree Traversal and its Application in Sequence
Abstract：Tree structure widely exists in the objective world, including trees, forest and binary tree and complete binary tree and binary tree, of which the most binary tree commonly used, sorting is a sequence of one order, by a series of transformation into an orderly sequence. The sorting operation is one of the most important function of computer. This article first through the use of a binary tree. Traditional methods for sequence traversal, first in the sequence traversal, after the sequence traversal and analyze the relationship between the three. Put forward a more convenient to calculate the binary tree to fill in the blanks sequence traversal method. Calculating the projection sequence traversal. Explore the three kinds of binary tree traversal methods between the inner link between. At the same time, according to inner link between the three kinds of traversal sequence. To find the corresponding only binary tree. Secondly introduces sequence traversal in the role of the binary sort tree, finally introduced the tree based on binary tree selection sort and heap sort, and carries on the comparison to both. 源￥自%六^^维*论-文+网=www.lwfree.cn
Keywords: Tree; Binary tree; Traverse; The tree selection; Pile arrangement
目    录

1.预备知识    3
1.1 树的定义    3
1.2 树的基本性质    3
1.3 二叉树的定义    4
1.4 二叉树的性质    4
1.5 树和二叉树的区别    4
2.二叉树的遍历问题    5
2.1 二叉树的遍历    5
2.2根据遍历生成二叉树    8
3.中序遍历在二叉排序树中的应用    10
3.1 二叉排序树的定义    10
3.2 二叉排序树的构造过程    10
3.3 中序遍历二叉排序树    10
4.树形选择排序（Tree Selection Sort）    11
4.1 树形选择排序提出的背景    11
4.2 树形选择排序定义    12
4.3树形选择排序基本思想    12
5.堆排列    13
5.1堆排列的定义    13
5.2 堆排序思想    14
5.3 树形选择排序和堆排序的比较    17
6. 结束语    17

------分隔线----------------------------