Binary search tree: traverse

From Algowiki
Revision as of 10:25, 13 September 2014 by Luedecke (talk | contribs) (Created page with ":INORDER-TREE-WALK(x) ::if x ≠ NULL :::INORDER-TREE-WALK(left[x]) :::print key[x] :::INORDER-TREE-WALK(right[x])")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search
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=177"