A new non-recursive algorithm for binary search tree traversal

Proceedings of the IEEE International Conference on Electronics, Circuits, and Systems

Volumn 2, Issue , 2003, Pages 770-773

  Ai Rawi, Akram ^a   Lansari, Azzedine ^a   Bouslama, Faouzi ^a  

^a ZAYED UNIVERSITY   (United Arab Emirates)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY SEARCH TREES; COMPILER DESIGN; LITERATURE SURVEY; OPERATING SYSTEMS; PREORDERS; RECURSIONS; RECURSIVE ALGORITHMS; SEARCHING ALGORITHMS; TREE TRAVERSAL; POST-ORDER TRAVERSALS;

ALGORITHMS; BINARY TREES; COMPUTER OPERATING SYSTEMS;

TREES (MATHEMATICS);

EID: 77952011714     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICECS.2003.1301900     Document Type: Conference Paper

References (4)

1. M. Weiss, Data Structures & Problem Solving Using Java, 2nd ed., Addison Wesley, 2002
2. D.E. Knuth, The Art of Computer Programming, Vol.3 (2nd ed.): Sorting and Searching, Addison Wesley, 1998.
3. J. Driscoll, and Y. Lien, A Selective Traversal Algorithm for Binary Search Trees, Communications of the ACM, Number 6, Vol.21, 1978, pp. 445-447
4. R. Sedgewick, Algorithms in Java, 3rd edition, Addison Wesley, 2003