Binary search tree: traverse

From Algowiki
Revision as of 20:05, 25 September 2014 by Jhohmann (talk | contribs)
Jump to navigation Jump to search


Genaral Information

Abstract View

Induction Basis

Induction Step

Complexity

Pseudocode

INORDER-TREE-WALK(x)
if x ≠ NULL
INORDER-TREE-WALK(left[x])
print key[x]
INORDER-TREE-WALK(right[x])
Retrieved from "https://wiki.algo.informatik.tu-darmstadt.de/index.php?title=Binary_search_tree:_traverse&oldid=292"