Practice Introduction To Heaps (9.1) - Heaps - Design & Analysis of Algorithms

Practise this section

9 questions

Flashcard drill
2 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 shape property of a heap?
Show hintHide hint
Think about how a tree's structure is defined.
Question 2.
In a max heap, which is greater, a parent or its children?
Show hintHide hint
Consider how 'max' is defined in 'max heap'.
3Question 3.
Which operation retrieves the highest priority element in a max heap?
- Insert
- Delete Max
- Search
Show hintHide hint
Think about which operation relates to removing the top element.
4Question 4.
True or False: Every child in a max heap must be smaller than its parent.
- True
- False
Show hintHide hint
Reflect on the definition of a max heap.
Question 5.
Given a sequence of numbers, insert them into a max heap one by one. Start with [10, 20, 30]. What does the heap look like after all insertions?
Show hintHide hint
Remember how to maintain the max heap property with each insertion.
Question 6.
Construct a heap from the following set of values: 15, 10, 20, 8, 30, 25. Show the tree structure.
Show hintHide hint
Think about how to position values to maintain both the shape and value properties.

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