n.(樹的)后序(遍歷)

The new method makes the preorder and postorder traversal of the binary- tree as easy as linear list. 論述了二叉樹后序遍歷的遞歸算法和非遞歸算法,對遞歸算法中的工作棧的執(zhí)行過程做了分析。

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的用于動畫插入，刪除和搜索（前序和后序算法）節(jié)點二叉樹。

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. 中序遍歷二叉搜索樹會使所有的節(jié)點按關(guān)鍵字升序被訪問到。如果希望在二叉樹中創(chuàng)建有序的數(shù)據(jù)序列，這是一種方法。

tree postorder 樹后根次序

binary tree postorder 二叉樹后段次序