Binary search tree: traverse: Difference between revisions
Jump to navigation
Jump to search
(Created page with ":INORDER-TREE-WALK(x) ::if x ≠ NULL :::INORDER-TREE-WALK(left[x]) :::print key[x] :::INORDER-TREE-WALK(right[x])") |
No edit summary |
||
| Line 4: | Line 4: | ||
:::print key[x] | :::print key[x] | ||
:::INORDER-TREE-WALK(right[x]) | :::INORDER-TREE-WALK(right[x]) | ||
[[Category:Binary Search Tree]] | |||
Revision as of 22:06, 19 September 2014
- INORDER-TREE-WALK(x)
- if x ≠ NULL
- INORDER-TREE-WALK(left[x])
- print key[x]
- INORDER-TREE-WALK(right[x])
- if x ≠ NULL