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

Visiting root node first then left and right sub-trees is called Answer choicesSelect only one optionREVISITIn-order TraversalPost-order TraversalPre-order TraversalNone of these

he maximum height of a binary search tree is O(log n), where n is the number of nodes.Group of answer choicesTrueFalse

Correctly identify the following heap structure by selecting the best answer:Question 16Select one:a.partially ordered heapb.max-heap structurec.priority heapd.min-heap structure

Which traversal order visits the root node first, followed by the left subtree and then the right subtree?Group of answer choicesPostorderLevel orderInorderPreorder

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