![]() |
![]() |
![]() |
![]() |
![]() | |
![]() |
![]() | ||||
![]() | ![]() | ![]() | ![]() |
Because a node in a binary tree can have one or two descendants, deleting such a location can cause a lot of problems. After examining the code to delete from a binary tree, you will then solve a mirror image variation of this routine in your lab exercise. The use of diagrams to follow this algorithm is very important. The key topics for this lesson are: |
![]() | ![]() | ![]() | ![]() | ||
![]() |
|
|
|