Practice Max Heap Property (9.2.2.1) - Heaps - Design & Analysis of Algorithms

Practise this section

9 questions

Flashcard drill
3 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 primary property of a Max Heap?
Show hintHide hint
Think about the structure of a Max Heap.
Question 2.
How are heaps filled?
Show hintHide hint
Visualize how a tree grows.
3Question 3.
In a Max Heap, which is true?
- The root is the smallest element
- The root is the largest element
- Children can be larger than their parent
Show hintHide hint
Think about the definition of a Max Heap.
4Question 4.
True or False: Insertion in a Max Heap can occur anywhere in the tree.
- True
- False
Show hintHide hint
Recall the ordering rules of heaps.
Question 5.
You have a Max Heap containing the elements {30, 20, 10}. If we insert 25, what is the new configuration of the heap?
Show hintHide hint
Consider where 25 would sit and check upward for correctness.
Question 6.
Explain the worst-case time complexity of insertion and deletion in a Max Heap, and demonstrate one operation.
Show hintHide hint
Use examples to illustrate how many swaps might occur.

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