遍历二叉树（*）任务：按先序次序输入二叉树中结点的值（一个字符），`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