| Tree Recursive Insert |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| • | What
you should have concluded is that the |
||||||||||||
| efficiency
of this approach depends greatly on the |
|||||||||||||
| “shape”
of the binary search tree |
|||||||||||||
| • | For
example, what if you entered in 1000 names |
||||||||||||
| all
in sorted order? |
|||||||||||||
| – | what
shape would your BST be? |
||||||||||||
| • | What
if, instead, the data was entered in random |
||||||||||||
| order? |
|||||||||||||
| – | which
is better and why? |
||||||||||||