分别采用递归和非递归方法，实现二叉树的链表存储实现的基本操作函数（包括二叉树的建立、释放、中序遍历、输出、测深度）。

　　-Using recursive and non recursive method, the basic operating functions (including the establishment of a binary tree, the release of the linked list storage implementation of the binary tree, in preorder traversal, output, measured depth).