postorder meaning in English

后根次序
后序

A discussion of postorder - traverse binary tree with no - recursive algorithm
递归算法的非递归化研究
Nevertheless , some indices do not contain all element nodes , many paths need to still be examined in the query ; other indices produce redundant data in the preorder or postorder traversal , this makes the cost of query much more
然而有的索引不包含所有的元素结点，因而在进行查询时许多路径仍需要检测；有的在向前或向后遍历时产生了大量的冗余数据，从而造成查询代价较大。
It presents the arithmetic that is achieved by postorder traversing binary tree , which is built from aov diagraph , based on investigating the arithmetic of interchanging between the ladder diagram and instruction list , and the interpretation and execution of plc programming language . the whole software is developed in visual c + + ide with mfc and multi - threads mechanism . the software is well constructed and conforms to a standard of iec61131
在重点研究了编程软件中梯形图与指令表程序的转换算法以及指令解释执行的原理和方法的基础上,提出了由aov有向图建立二叉树、并对其进行后序遍历来实现梯形图程序与指令表程序转换的算法,并给出了算法在编程软件中的具体实现。