广义表实现二叉树的非递归后序遍历。二叉树以二叉链表作为储存结构。用非递归算法后序遍历二叉树。定义广义表实现二叉树的输入。对于二叉树的后序遍历打印出遍历结果。

-Generalized form of a binary non-recursive postorder traversal. Binary to binary tree as a storage structure. After a non-recursive traversal of a binary tree algorithm. Define the generalized form of a binary input. For the binary tree after preorder traversal to print out the results.