二叉树的应用

任务 ：编程实现二叉树的建立，层次遍历，（递归和非递归方法）先序、中序、后序，二叉树的高度、宽度，二叉排序树的插入、删除；

基本要求：从文件中读入建树信息，树的节点数目不小于20个，树的高度不小于5；

-Binary tree of tasks: programming the establishment of the binary tree hierarchy traversal (recursive and non-recursive method) preorder, inorder, postorder binary tree of height, width, binary sort tree insert, delete　basic requirements: from a file reads achievements information, the number of nodes of the tree is not less than 20, the height of the tree is not less than 5