For construction of a binary heap with property that parent node has value less than child node. In reference to that which line is incorrect. Line indexed from 1.

1. add(int k)
2. {
3.     heap_size++; 
4.     int i = heap_size - 1;
5.     harr[i] = k;
6.     while (i != 0 && harr[parent(i)] < harr[i])
7.     {
8.             swap(&harr[i], &harr[parent(i)]);
9.             i = parent(i);
10.    }
11. }

What is the time complexity of inserting an element into a binary heap?

A. O(1)

B. O(log n)

C. O(n)

D. O(n log n)

Which of the following is true for a min-heap?

A. The root node is the smallest element, and every parent node is smaller than its children.

B. The root node is the largest element, and every parent node is larger than its children.

C. All nodes are arranged in a complete binary tree.

D. The tree is always balanced.

In a max-heap, which node property is true?

A. Every parent node is greater than or equal to its children.

B. Every parent node is less than or equal to its children.

C. All nodes have the same value.

D. The root node is always the smallest element.

How do you maintain the heap property after deleting the root node?

A. By performing a heapify operation.

B. By reordering the entire heap.

C. By inserting a new element at the root.

D. By performing an inorder traversal.