20.Given a binary min heap of height 6. What are the minimum and maximum number of comparisons we might have to do when doing a deletemin?

19. Given the binary search tree shown below. Draw what the tree would look like after deleting the value 9. Use one of the methods for deleting described in class or in the book. 33 88 20. Given a binary min heap of height 6. What are the minimum and maximum number of comparisons we might have to do when doing a deletemin 19. Given the binary search tree shown below. Draw what the tree would look like after deleting the value 9. Use one of the methods for deleting described in class or in the book. 33 88 20. Given a binary min heap of height 6. What are the minimum and maximum number of comparisons we might have to do when doing a deletemin