| Tree Recursive Insert |
|
|
|
|
|
|
|
|
|
|
| | Now
lets apply what we have learned to |
||||||||
| insert
into a binary search tree |
|||||||||
| | Remember,
if the data being inserted is less |
||||||||
| than
the root, we want to traverse left |
|||||||||
| | If
the data being inserted is greater than the |
||||||||
| root,
we want to traverse right |
|||||||||
| | If it
is the same, pick a consistent approach |
||||||||
| to
deal with it (either left or right) |
|||||||||