Exercises

1. What will be the time complexity for deleting an arbitrary element from the min-heap?
2. What will be the time complexity for finding the kth smallest element from the min-heap?
3. What will be the worst-case time complexity for ascertaining the smallest element from a binary max-heap and binary min-heap?
4. What will be the time complexity to make a max-heap that combines two max-heap each of size n?
5. The level order traversal of max-heap is 12, 9, 7, 4, and 2. After inserting new elements 1 and 8, what will be the final max-heap and the level order traversal of the final max-heap?
6. Which of the following is a binary max-heap?

Figure 7.21: Example trees

Join our community on Discord

Join our community’s Discord space for discussions with the author and other readers: https://packt.link/MEvK4