二叉搜索树在动态查表中有特别的用处，一个无序序列可以通过构造一棵二叉搜索树变成一个有序序列，构造树的过程即为对无序序列进行排序的过程。每次插入的新的结点都是二叉搜索树上新的叶子结点，在进行插入操作时，不必移动其它结点，只需改动某个结点的指针，由空变为非空即可。



这里，我们想探究二叉树的建立和序列输出。-Binary search tree has a dynamic look-up table in particular the usefulness of an unordered sequence can construct a binary search tree into an ordered sequence, the process of construction of the tree is the sort of process sequence disorder. Every time a new node is inserted into a binary search tree new leaf node, during the insertion operation, without moving the other nodes, just a pointer to a node changes, namely　empty to non-empty can. Here, we want to explore the creation and output binary sequence.