Derivation and Formal Proof of Binary Tree Depth Non-Recursive Algorithm

Author(s):  
Zhengkang Zuo ◽  
Yue Fang ◽  
Qing Huang ◽  
Yunyan Liao ◽  
Yuan Wang ◽  
...  
2014 ◽  
Vol 631-632 ◽  
pp. 99-102
Author(s):  
Yu Cheng Song ◽  
Shao Li Jin

Traversing binary tree is an important algorithm in data structure. This paper analyses and discusses the recursive algorithm implementation of preorder-traversing binary tree through instance. It would contribute beginners to understand more deeply the process of preorder-traversing and enhance their programming.


2011 ◽  
Vol 63-64 ◽  
pp. 222-225
Author(s):  
Min Wang

By analyzing the storage structures of forest and binary tree, this paper introduced the design ideas of the non-recursive simulation on the recursive algorithm of binary tree reverting to its corresponding forest, gave the non-recursive simulation algorithm in C using stack structure and loop structure, and then analyzed and evaluated the recursive and non-recursive algorithms on the two aspects of time complexity and space complexity.


2012 ◽  
Vol 43 (10) ◽  
pp. 25-28 ◽  
Author(s):  
Nitin Arora ◽  
Vivek Kumar Tamta ◽  
Suresh Kumar

Author(s):  
Rob Nederpelt ◽  
Herman Geuvers
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document