期刊文献+

Recursive and Nonrecursive Traversal Algorithms for Dynamically Created Binary Trees

Recursive and Nonrecursive Traversal Algorithms for Dynamically Created Binary Trees
下载PDF
导出
出处 《Computer Technology and Application》 2012年第5期374-382,共9页 计算机技术与应用(英文版)
关键词 非递归算法 遍历算法 动态创建 二进制树 时间序列建模 复杂度分析 程序实现 动力系统 Binary e-trees, algorithms, tree traversal, preorder, inorder, postorder, recursive, nonrecursive, space-time complexity.
  • 相关文献

参考文献7

  • 1J.P. Crutchfield, Computational Mechanics Publications, available online at: http://csc.ucdavis.edu/-chaos/chaos/pub s.htm, accessed: April 2012.
  • 2R. Logozar, A. Lovrencic, The modeling and complexity of dynamical systems by means of computation and information theories, Journal of Information and Organizational Sciences 35 (2) (2011).
  • 3E. Horowitz, S. Sahni, Fundamentals of Computer Algorithms, Pitman Publish Ltd, London, 1979.
  • 4N. Wirth, Algorithms & Data Structures (New Edition), Prentice/Hall International, London, 1986.
  • 5A.B. Tucker at al., Fundamentals of Computing Ⅱ, C++ Edition, McGraw-Hill, New York, 1995.
  • 6A.V. Aho, J.E. Hopcroft, J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Massachusetts, 1974.
  • 7R. Logozar, Modeling of dynamical systems by stochastic finite automata, Master Thesis, Faculty of Electrical Engineering and Computing, University of Zagreb, 1999.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部