n.(树的)后序(遍历)
The new method makes the preorder and postorder traversal of the binary- tree as easy as linear list. 论述了二叉树后序遍历的递归算法和非递归算法,对递归算法中的工作栈的执行过程做了分析。
Very good Java Applet used to animate Inserting, Deleting and Searching (Preorder & Postorder algorithm) nodes in Binary Trees. You can use and redistribute the (译)：非常好的Java Applet的用于动画插入，删除和搜索（前序和后序算法）节点二叉树。
Traversing a tree means visiting each node in a specified order. There are three simple ways to traverse a tree. They're called preorder, inorder, and postorder. 中序遍历二叉搜索树会使所有的节点按关键字升序被访问到。如果希望在二叉树中创建有序的数据序列，这是一种方法。
tree postorder 树后根次序
binary tree postorder 二叉树后段次序
