Introduction - If you have any usage issues, please Google them yourself
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