基于二叉链表存储结构实现二叉树的基本运算，要求：

⑴能建立非空二叉树；

⑵实现二叉树的先、中、后序递归遍历算法；

⑶实现二叉树的非递归的先（或中、或后）序遍历算法及层序遍历算法；

⑷记录运行结果并对递归算法和非递归算法的效率加以分析。

-List storage structure based on binary binary tree of basic operations, require: ⑴ to establish a non-empty binary tree　⑵ binary tree prior, during and after order recursive traversal algorithm　⑶ first to achieve non-recursive binary tree (or middle or rear) preorder traversal algorithms and sequence algorithm　⑷ record operating results and non-recursive and recursive algorithm to analyze the efficiency of the algorithm.