postorder traversal
基本解释
- 后序遍历
英汉例句
- Given a binary tree, return the postorder traversal of its nodes' values. For exampl …
原始题目如下，意为后序遍历二叉树，不要用递归。 - 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.
说明：二叉树操作：建立二叉树，前序遍历二叉树、中序、后序遍历二叉树。
双语例句
词组短语
- Postorder Traversal of Binary Tree 二叉树后序遍历
短语
专业释义
- 后序遍历
This paper summarizes the relation of the four different array though the analysis of getting four arrayfrom the same binary tree using four different algorithm: preorder traversal,inorder traversal,postorder traversal and level traversal,to determine the corresponding binary tree.
通过对同一棵二叉树的前序遍历、中序遍历、后序遍历及层次遍历得到四个不同序列的分析，概括出二叉树的前序遍历、中序遍历、后序遍历及层次遍历序列间的关系，确定对应的二叉树。 - 后序编历