实现二叉树遍历的Visual C++程序，要求输入二叉树的各结点后可以算出其三种遍历，即先序，中序，后序。-Binary Tree Traversal implementation of the Visual C++ procedures for the importation of all tree nodes can be worked out after its three ergodic, that is first order, in sequence, after the seque