A new non-recursive algorithm for binary search tree traversal
Source of Publication
Proceedings of the IEEE International Conference on Electronics, Circuits, and Systems
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.
Binary search trees, Compiler design, Literature survey, Operating systems, Preorders, Recursions, Recursive algorithms, Searching algorithms, Tree traversal, Binary search trees, Compiler design, Literature survey, Post-order traversals, Recursions, Recursive algorithms, Searching algorithms, Tree traversal, Algorithms, Binary trees, Computer operating systems, Algorithms, Binary trees, Trees (mathematics), Trees (mathematics)
Ai-Rawi, Akram; Lansari, Azzedine; and Bouslama, Faouzi, "A new non-recursive algorithm for binary search tree traversal" (2003). All Works. 184.
Indexed in Scopus