Practice Heap Shape And Value Property (9.2.2) - Heaps - Design & Analysis of Algorithms

Practise this section

10 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
4 questions · about 3 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
What is a heap?
Show hintHide hint
Think about how it relates to priorities.
Question 2.
Describe the shape property of a heap.
Show hintHide hint
How do we add elements?
3Question 3.
What is the main operation to retrieve the highest priority job in a max heap?
- Delete Min
- Insert
- Delete Max
Show hintHide hint
Think about the name of the operation.
4Question 4.
True or False: In a max heap, child nodes can have values greater than their parent node.
- True
- False
Show hintHide hint
Consider the definition of max heaps.
Question 5.
Given the following elements, insert them into a max heap: 20, 15, 30, 25, 10, 5. Show the steps, including any necessary adjustments.
Show hintHide hint
Remember to bubble up when the max heap property is violated.
Question 6.
Explain why a completely filled binary tree with violations cannot function as a max heap, using an example.
Show hintHide hint
What does the max heap definition tell you?

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