1、实现折半查找算法 2、实现二叉排序树的建立、查找和删除 -1, to achieve the bisearch algorithm 2, the establishment of two fork sort tree, find and delete

定义二叉链表类型，实现二叉树的基本操作：建立、先中后序遍历、层次遍历及输出。-The definition of two fork list type, two fork tree to achieve the basic operation: the establishment, the first in the order traversal, hierarchical traversal and output.