What are the necessary condition for a Tree to be a heap?a.The tree must be completeb.Every node must follow left or right valuesc.The tree must be compete and root node value is greater or smaller than the children’s valued.Every root node value is greater or smaller than the children’s value

Differentiate between binary search tree and a heap

Consider a complete binary tree where the left and the right subtrees of the root are max-heaps. Find the lower and upper bound for the number of operations to convert the given tree to a heap. Justify your answer with a proper explanation.

Which of the following is the valid min heap?

Question 1Consider a minheap that is presented as a tree below:Select all the correct facts from the list below.5 pointsThe minheap property is that each element is smaller than its left child and larger than its right child. This property is not satisfied by the example above.The second smallest element of a minheap is always the second element in the arrayThe minheap property is that each element is smaller than or equal to its children (if they exist). The example above satisfies the minheap property.If an element 2 is inserted into the heap at the end of the array, as the left child of the element 6, the min heap property will continue to be true.The heap when written as an array will be [-5, 8, 4, 12, 10, 6, 19, 13, 17, 11, 12]The second smallest element of a minheap is always the smaller of the two children of the root node.

In a max-heap, element with the greatest value is always present at: Answer choicesSelect only one optionREVISITLeaf nodeFirst node of left sub treeRoot nodeFirst node of right sub tree5/10 questions attempted