1.建立完全二叉树

2.先序非递归遍历二叉树函数 & 先序递归遍历二叉树验证

3.中序非递归遍历二叉树函数 & 中序递归遍历二叉树验证

4.后序非递归遍历二叉树函数 & 后序递归遍历二叉树验证

-1 to establish a fully binary tree 2 first order non-recursive binary tree traversal function preorder recursive traversal of binary tree &　validation 3. In order binary tree traversal non-recursive function &　verification in order binary tree traversal recursion 4. After order traversal non-recursive function &　postorder recursive binary tree traversal binary tree verification