英语语法分析

Finally algorithms for removing difficult visitable in postorder threaded binary trees are given.

给出了消除二叉后序线索树中困难访问的算法。

An assembly sequence can be automatically generated by implementing the postorder traversal to this model.

通过对该结构的后序遍历，自动生成装配序列，能有效地描述装配体。

Binary tree operation: create a binary tree, before traversing binary, inorder, postorder binary tree traversal.

说明：二叉树操作：建立二叉树，前序遍历二叉树、中序、后序遍历二叉树。