二)二叉排序树的一些基本操作

(1)利用二叉链表的存储形式，从键盘输入建立一棵二叉排序树；

(2)对（1）中建立的二叉排序树进行中序遍历并打印；

(3)编写算法，判断一棵二叉树是否为二叉排序树。

(4)在（1）建立的二叉排序树中，查找一个树中不存在的关键字后并插入，之后打印该树；

-B) binary tree of some sort of basic operations (1) the use of binary list of the storage form of input from the keyboard to establish a binary sort tree　(2) (1) create a binary tree in order traversal and print　(3) the preparation method, a binary tree to determine whether the binary sort tree. (4) (1) to establish the binary sort tree, find a tree that does not exist and insert the keyword, and then print the tree