Answer:
A complete heap is a heap in which the all the nodes are completely filled and the level of the each node are equal to each other. So, if the heap satisfied this condition then, the heap are complete.
In the computer science, heap is the special type of tree based on the data structure. Binary heap is one of the type of heap and it become complete binary tree when, it satisfied the ordering of heap property.
There are basically two types of heap ordering that are:
1) MAX heap property: In the max heap ordering property each node are less than or equal to its parent node value.
2) MIN heap property: In the min heap property each node is greater and equal to its particular parent value.
