建立一颗用二叉链表方式存储的二叉树，并对其遍历，打印输出遍历结果。-The establishment of a list with the 2 fork stored in a binary tree, and its traverse, traverse the results printout.

手动输入各个结点建立二叉树(递归) ,普通二叉树的先序和后序遍历(递归),中序线索化(递归), 线索二叉树的先序和中序遍历(递归),线索二叉树的中序遍历(非栈、非递归), 层次遍历(使用队列),销毁整棵二叉树(递归)-Manually enter each node to build a binary tree (recursively), common binary tree inorder and postorder traversal (recursive), the sequence