/*综合性试验（排序二叉树）

1.建立一棵排序二叉树（随机产生1000个0～999的数）

2.前、中、反中序遍历

3.统计叶子数、结点数、深度

4.查找、插入、删除

5.求最大、最小值

6.求查找的次数n1，与二分查找作比较（n1>n2，二叉树不均衡）

7.排序算法与中序遍历的效率比较

*8.将上述各步的结果写入文件（result.txt）-/* Test (sort of binary tree)

(1) to establish a sort binary tree (randomly generated 1000 the number of 0 to 999)

, Anti-inorder traversal 2.

Statistics leaf number, number of nodes, depth

Find, insert, delete

Find the maximum and minimum values

Seek to find the number n1, and the binary search (n1> n2, the binary tree is not balanced)

The efficiency of sorting algorithms and in-order traversal

* 8. The results of the above steps to write to a file (result.txt)