Practice Insertion And Deletion In Heaps (9.4) - Heaps - Design & Analysis of Algorithms

Practise this section

9 questions

Flashcard drill
4 cards from this section. Quick, good the night before a test.
Exercise
6 questions · about 4 min · pass mark 70%. Hints available.
Sign up to start the exercise
Quiz
3 questions · about 2 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
What is the maximum value of a max-heap?
Show hintHide hint
Look at the root of the tree.
Question 2.
Describe how to insert a new value into a heap.
Show hintHide hint
What position do we fill when adding a new node?
3Question 3.
What property must a max-heap satisfy?
- A. Every parent node must be less than its children.
- B. Every parent node must be equal to its children.
- C. Every parent node must be greater than or equal to its children.
Show hintHide hint
Think about the definition of max-heap.
4Question 4.
True or False: Insertion in a heap can violate the max-heap property.
- True
- False
Show hintHide hint
What happens when we add a value larger than its parent?
Question 5.
Given a max-heap of [30, 20, 25], insert 15 and demonstrate the steps required to maintain the heap property.
Show hintHide hint
Where does 15 go, and does it change anything?
Question 6.
Starting with the heap [50, 30, 25, 20, 15], delete the root and show the new state of the heap after replacement and sifting down.
Show hintHide hint
Ensure to visualize each change step.

5 more questions in this section. Enroll free to practise them all.