Title
A new non-recursive algorithm for binary search tree traversal
Source of Publication
Proceedings of the IEEE International Conference on Electronics, Circuits, and Systems
Abstract
Binary tree traversal refers to the process of visiting each node in a specified order. There are two ways to visit a tree: recursively and non-recursively. Most references introduce tree traversal using recursion only. Our literature survey indicated that most references only show the implementations of the recursive algorithms, and only few references address the issue of nonrecursive algorithms. In this paper we investigate (compare) recursive and non-recursive algorithms for inorder, preorder, and postorder traversals. The inorder traversal of a binary search tree is important in searching algorithms, operating systems, and compiler design. In this paper we propose a new non-recursive algorithm for inorder binary search trees that is both efficient and easy to understand. The implementation of this new algorithm was done in Java and the complete algorithm was tested. The new algorithm was found to be faster than other nonrecursive algorithm. © 2003.IEEE.
Document Type
Conference Proceeding
ISBN
['0780381637', '9780780381636']
First Page
770
Last Page
773
Publication Date
12-1-2003
DOI
10.1109/ICECS.2003.1301900
Recommended Citation
Ai-Rawi, Akram; Lansari, Azzedine; and Bouslama, Faouzi, "A new non-recursive algorithm for binary search tree traversal" (2003). Scopus Indexed Articles. 2555.
https://zuscholars.zu.ac.ae/scopus-indexed-articles/2555