【二叉树遍历的递归算法实现】

操作：根据提示输入相应数据实现各种功能

函数：菜单函数(menu)

前序建立二叉树(Crt_BinTree)

访问结点(Visit)

前序遍历(Pretraverse)

中序遍历(Intraverse)

后序遍历(Suctraverse)

删除树(Destory)

操作函数(perform)Pretraverse

主函数(main)

说明：结点数据初始为char型，但可在前面代码部分修改

成其他类型，输入时@代表子树为空-The binary tree traversal of recursion algorithm 】

Operation: according to the prompt corresponding input data realization of different functions

Function: the menu function (menu)

The preface to establish a binary tree (Crt_BinTree)

Access nodes (Visit)

The preface to traverse (Pretraverse)

In order to traverse (Intraverse)

After traverse sequence (Suctraverse)

Delete tree (Destory)

Operation function (perform) Pretraverse

The main () function (main)

Note: data for type char initial nodes, but can be in front the code changes

Into other types, input on behalf of children for empty @ tree