SHORT ANSWERS: Suppose tree Tis a min heap of height 3. - What is the largest number of nodes that T can have? _____________________ - What is the smallest number of nodes that T can have?...

1. SHORT ANSWERS:


2. Suppose tree Tis a min heap of height 3.

- What is the largest number of nodes that T can have? _____________________

- What is the smallest number of nodes that T can have? ____________________

1. The worst case complexity of deleting any arbitrary node element from heap is ___________