 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
| • |
To
prepare for next class
|
|
|
|
– |
write
C++ code to insert a new data item at a
|
|
|
|
leaf
in the appropriate sub-tree using the binary
|
|
|
search
tree concept
|
|
|
|
– |
think
about what you might need to do to then
|
|
|
|
remove
an item?
|
|
|
|
– |
what
special cases will we need to consider?
|
|
|
|
– |
how
might we make a copy of a binary search
|
|
|
|
tree?
|
|