Priority Queues: Quiz >> Data Structures
*Please Do Not Click On The Options.
* If You Click Mistakenly Then Please Refresh The Page To Get The Right Answers.
Priority Queues: Quiz
How many edges of this binary tree violate the min-heap property? In other words, for how many edges of the tree, the parent value is greater than the value of the child?
This binary tree contains 13 nodes, and hence we have 13 subtrees here (rooted at each of 13 nodes). How many of the subtrees are complete?
How many edges of this tree violate the max-heap property? In other words, for how many edges of the tree, the parent value is smaller than the value of the child?