PPT Slide
If tree T has height h and branching factor b, what are the largest and smallest numbers of nodes that T can have?
Starting with the heap below, show what happens when we do the following (assume bubbleup, etc.)
- Insert 3
- Delete 20
- Delete the maximum element
- Again delete the maximum element
-
18,18,16,9,7,1,9,3,7,5