Try this exercise. Fill in the missing part by typing it in.
A max heap is a complete binary tree where the value of each node is ____ the values of its children.
Write the missing line below.
Back to course sections
Mark As Completed Discussion
A max heap is a complete binary tree where the value of each node is ____ the values of its children.
Write the missing line below.