程序运行时，先输入二叉树结点的值（一个字符），先建立二叉树，然后对建立的二叉树分别进行先序、中序、后序遍历；要求格式化输出遍历结果：每一序列数据之间用“—〉”分开，三种遍历结果应该分行显示；输出结果之前最好给出提示，如：“InOrderTraverse：”。-Program runs, enter the value of binary tree nodes (one character), first create a binary tree, and then the establishment of the tree were first order, in sequence, after traversal　request formatted output Traversal Results: The data for each sequence with ->　to separate the three branches of ergodic results should display　output before the best tips given, such as:　InOrderTraverse: .