Practice Heap Structure And Properties (9.2) - 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 defines a max heap?
Show hintHide hint
Focus on parent-child relationships.
Question 2.
Describe the shape property of a heap.
Show hintHide hint
Think about how nodes are structured.
3Question 3.
What is the primary property of a max heap?
- The root is the smallest value
- Every parent is greater than its children
- All levels except the last are filled
Show hintHide hint
Think about the relationships between parent and child.
4Question 4.
True or False: A max heap can have gaps between nodes?
- True
- False
Show hintHide hint
Recall the definition of a complete binary tree.
Question 5.
Construct a max heap from the following sequence of integers: 10, 20, 5, 6, 1, 30.
Show hintHide hint
Remember to 'bubble up' after each insertion as necessary.
Question 6.
Design an algorithm to delete the max element in a max heap and illustrate with an example.
Show hintHide hint
Follow the process closely to maintain the heap.

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