| Tree Removal: Special Cases |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| • | Removing
a node with 2 children |
||||||||||||||
| – | One
way to do this is to not delete the node; |
||||||||||||||
| instead
replace the data in this node with another |
|||||||||||||||
| node's
data...it can come from immediately after |
|||||||||||||||
| or
before the search key being deleted. |
|||||||||||||||
| – | How
can a node with a key matching this |
||||||||||||||
| description
be found? |
|||||||||||||||
| • | Simple. |
||||||||||||||