二叉搜索树，二叉搜索树的查找过程和次优二叉树类似，通常采取二叉链表作为二叉搜索树的存储结构。中序遍历二叉搜索树可得到一个关键字的有序序列，一个无序序列可以通过构造一棵二叉搜索树变成一个有序序列，构造树的过程即为对无序序列进行排序的过程。每次插入的新的结点都是二叉搜索树上新的叶子结点，在进行插入操作时，不必移动其它结点，只需改动某个结点的指针，由空变为非空即可。搜索,插入,删除的复杂度等于树高。-Binary search tree, binary search tree to find a similar process and sub-optimal binary tree, usually linked to the binary search tree as a binary storage structure. Inorder traversal of a binary search tree obtained an ordered sequence of keywords, one can construct a sequence of random binary search tree into an ordered sequence, the process of the tree structure is the sort of random sequences process. Each time a new node into the binary search tree is a new leaf node, during the insertion operation, without moving the other nodes, just the pointer changes to a node from the air into a non-empty be. Search, insert, delete, equal to the complexity of tree height.