1.以二叉链表作存储结构，编写前序、中序、后序及层次顺序遍历二叉树的算法。

2、 以二叉链表作存储结构，编写计算二叉树深度、所有结点总数、叶子结点数、双孩子结点个数、单孩子结点个数的算法

用非递归（栈 或 队列）实现前序、中序、后序及层次顺序遍历二叉树的算法

-A binary list storage structure, written preamble, inorder, postorder and level order traversal of a binary tree algorithm.

2 binary linked list storage structure, written to calculate the binary tree depth, the total number of all nodes, leaf nodes, the number of two-child node, the number of single-child node algorithm

Preorder, inorder, postorder and level order traversal of a binary tree algorithm non-recursive (stack or queue)