Binary search tree: traverse: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 1: | Line 1: | ||
[[Category:Binary Search Tree]] | |||
== Genaral Information == | |||
== Abstract View == | |||
== Induction Basis == | |||
== Induction Step == | |||
== Complexity == | |||
== Pseudocode == | |||
:INORDER-TREE-WALK(x) | :INORDER-TREE-WALK(x) | ||
::if x ≠ NULL | ::if x ≠ NULL | ||
| Line 4: | Line 17: | ||
:::print key[x] | :::print key[x] | ||
:::INORDER-TREE-WALK(right[x]) | :::INORDER-TREE-WALK(right[x]) | ||
Revision as of 20:05, 25 September 2014
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])
- if x ≠ NULL