The Analysis on Recursive Algorithm Implementation of Preorder-Traversing Binary Tree

Article Preview

Abstract:

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.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

99-102

Citation:

Online since:

September 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Weimin Yan, Weimin Wu: Data structure (Tsinghua University Press, Beijing 2003).

Google Scholar

[2] Yuli Yuan, Ling Hu: Journal of Neijiang Teachers College. No. 4 Vol. 21 (2005), pp.109-111.

Google Scholar

[3] Zili Tang: China Science and Technology Information. Apr (2006), pp.290-291.

Google Scholar

[4] Zhichao Dai: Journal of Guangdong Polytechnical Normal University. No 4 (1999), pp.79-82.

Google Scholar