本代码提供了二叉树前序、中序、后序遍历的三种遍历方法，实现了遍历的图形化演示，使用了初学者以及日常课程教学。-This code provides a pre-binary sequence, three traversal methods in sequence, after traversing achieve a traversal of the graphical presentation, using the beginner as well as the daily teaching

二叉树遍历(Traversal)是指沿着某条搜索路线，依次对树中每个结点均做一次且仅做一次访问。访问结点所做的操作依赖于具体的应用问 题。-Binary tree Traversal (Traversal) refers to the search along a route, in turn, each node in the tree are one and only for a visit. Operations to do access nodes depends on the spec

遍历二叉树（*）任务：按先序次序输入二叉树中结点的值（一个字符），`0`表示空树，生成二叉树的二叉链表存储结构，然后按中序顺序遍历二叉树。-Binary Tree Traversal (*) Missions: According to the first sequence in the order of input binary tree node value (a character), `0` express empty tree, Binary tree generated list s

二叉树排序 采用中序遍历的方式 从小到大排序输出-Binary tree traversal order used in a way to sort the output small to large