Which of the following statements are true?

A heap is a full binary tree.

A binary tree is complete if every level of the tree is full except that the last level may not be full and all the leaves on the last level are placed left$-$most.

Each node is greater than or equal to any of its children.

A heap is a complete binary tree.