抽象的

On generation algorithm of prefix code-based postorder traversal tree and its application

Meixia Tang, Yu Liu


The paper strives to solve nodes structural relationship, and can effective produce traverse tree’s subtree and so on, therefore the paper proposes a kind of unified nodes and data structure prefix coding heel traverse tree generative algorithm, the algorithm is helpful for fuzzy searching and systematic analysis seeking, in addition, the algorithm doesn’t need any special requirements in running period, each node branch can be different, so the algorithm is a kind of general algorithm, it can construct subtree in case don’t increase complicated extents, by experiment, it can get the algorithm is obviously superior to traditional algorithm, so verify it by concrete experiments, and get the algorithm is convenient and effective.


免责声明: 此摘要通过人工智能工具翻译,尚未经过审核或验证

索引于

  • 中国社会科学院
  • 谷歌学术
  • 打开 J 门
  • 中国知网(CNKI)
  • 引用因子
  • 宇宙IF
  • 研究期刊索引目录 (DRJI)
  • 秘密搜索引擎实验室
  • 学术文章影响因子(SAJI))
  • ICMJE

查看更多

期刊国际标准号

期刊 h 指数

Flyer