×

后序遍历 meaning in English

postorder traversal

Examples

  1. A discussion on the recursive program
    二叉树后序遍历的非递归化算法讨论
  2. The recursive and non - recursive algorithm of post - traversing binary tree
    二叉树后序遍历的递归和非递归算法
  3. 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有向图建立二叉树、并对其进行后序遍历来实现梯形图程序与指令表程序转换的算法,并给出了算法在编程软件中的具体实现。
  4. The thesis uses four index files to complete the content index & structure index : chinese character index , english string index , element index and attribute index . the thesis first gives the pre - post node labeling method , then puts forward the tree - adjacent table , transforms the dom - tree into tree - adjacent table , in the last creates element index and attribute index from tree - adjacent table
    针对结构索引的建造,本文首先阐明了前序一后序节点标号法,然后提出了树邻接表的概念,并给出了把dom树转换为树邻接表的办法;最后对树邻接表进行前序-后序遍历,得到每个节点的标号,并组装成结构索引文件。
  5. It can be used in any complex environment , can locate all paths from transmitter to receiver which avoid redundant calculation , and it is a standard 3 - d forecast model ; in addition , it is a point to point ray tracing method based on specular theory which do n ' t carry out the receive test ; furthermore the model adopt the reverse arithmetic which exert the tree concept in data frame and establish a virtual fountain tree permanently , the proagmme can back - search the virtual fountain tree when it is running . these operation increase the calculate speed and it result in the higher receive efficiency and precision . the thesis design a programme to compare the prediction results based on ray tracing method of virtual fountain tree between the measurement results and prediction results based on the other transmittion models . the comparsion result indicate the new model is a better model
    它可应用于任何复杂的传播环境中,能找到发射机到接收机之间的所有电波传播路径而无须冗余的计算,是一种准三维的预测模型;另外,从本质上讲,它仍然是一种基于镜像理论的点对点的射线跟踪法,所以它无须进行接收测试;而且由于采用了反向算法,运用数据结构中多叉树的概念,先确定需要计算的场点位置,找出所有能从源点到达场点的射线,并且可一次性建立一个虚拟源树,以后每次的计算只要通过对该树进行后序遍历即可,大大提高了运算速度,因而有较高的接收效率与精度。本文对该模型进行了相应的仿真,并将其预测结果与实测结果以及基于cost231经验性模型和基于强力射线跟踪确定性模型的预测结果进行了比较,结果表明了该模型的优越性。

Related Words

  1. 后序
  2. 后序发行
  3. 前序中序后序
  4. 遍历
  5. 遍历假说
  6. 遍历状态
  7. 遍历各地
  8. 表遍历
  9. 键盘遍历
  10. 遍历噪声
  11. 后袖网
  12. 后序
  13. 后序发行
  14. 后续
PC Version

Copyright © 2018 WordTech Co.