Binary tree operation: create a binary tree, before traversing binary, inorder, postorder binary tree traversal.
说明：二叉树操作：建立二叉树，前序遍历二叉树、中序、后序遍历二叉树。
The concepts such as mathematical expression, stack operation and binary tree traversal must be presented in data structure.
数学表达式、栈的操作、二又树的遍历，这几个概念在数据结构的教材中是不可缺少的。
Recursive and non recursive implementation of binary tree traversal, the use of queues to achieve the level of binary tree traversal.
利用递归和非递归实现二叉树的中序遍历，利用队列实现二叉树的层次遍历。
应用推荐