Practice Inserting A Node Into The Heap (9.4.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 a heap?
Show hintHide hint
Think about a tree structure used to prioritize elements.
Question 2.
What does the max heap property require?
Show hintHide hint
Consider how numbers compare between parent and child.
3Question 3.
What is a core property of a heap?
- 1. Random Structure
- 2. Max Heap Property
- 3. Tree Node Only
Show hintHide hint
Recall the definitions and properties we covered.
4Question 4.
True or False: The structure of a heap allows for any node position to be filled randomly.
- True
- False
Show hintHide hint
Think about how we discussed constructing the heap.
Question 5.
Given a series of integers, insert them one by one into a max heap and show the steps taken after each insertion to maintain the heap property.
Show hintHide hint
Make sure to check against parents after each insertion!
Question 6.
The following structures show trees. Determine if they are heaps and explain why or why not.
Show hintHide hint
Mark the violations if found!

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