Which of the following statements about the binary heaps is NOT correct?

Group of answer choices

It is common to use binary heaps to implement priority queues.

In a binary heap, for every node X$,$ the elements in the left and right subtrees of X are greater than or equal to the element in X;

The time complexity of inserting a new element in a binary heap is O$(1)$;

A binary heap is a complete binary tree;