adplus-dvertising
frame-decoration

Question

If we implement heap as min-heap , deleting root node (value 1)from the heap. What would be the value of root node after second iteration if leaf node (value 100) is chosen to replace the root at start.

a.

2

b.

100

c.

17

d.

3

Answer: (a).2

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. If we implement heap as min-heap , deleting root node (value 1)from the heap. What would be the value of root node after second iteration if leaf node (value 100) is chosen to...

Similar Questions

Discover Related MCQs

Q. If we implement heap as maximum heap , adding a new node of value 15 to the left most node of right subtree . What value will be at leaf nodes of the right subtree of the heap.

Q. Binary trees can have how many children?

Q. Disadvantage of using array representation for binary trees is?

Q. What must be the ideal size of array if the height of tree is ‘l’?

Q. What are the children for node ‘w’ of a complete-binary tree in an array representation?

Q. What is the parent for a node ‘w’ of a complete binary tree in an array representation when w is not 0?

Q. If the tree is not a complete binary tree then what changes can be made for easy access of children of a node in the array ?

Q. Consider a situation of writing a binary tree into a file with memory storage efficiency in mind, is array representation of tree is good?

Q. Why is heap implemented using array representations than tree(linked list) representations though both tree representations and heaps have same complexities?

for binary heap

-insert: O(log n)

-delete min: O(log n)

for a tree

-insert: O(log n)

-delete: O(log n)

Then why go with array representation when both are having same values ?

Q. Can a tree stored in an array using either one of inorder or post order or pre order traversals be again reformed?

Q. Advantages of linked list representation of binary trees over arrays?

Q. Disadvantages of linked list representation of binary trees over arrays?

Q. How to travel a tree in linkedlist representation?

Q. Level order traversal of a tree is formed with the help of

Q. Why we prefer threaded binary trees?

Q. The following lines talks about deleting a node in a binary tree.(the tree property must not be violated after deletion)
i) from root search for the node to be deleted

ii)

iii) delete the node at

what must be statement ii) and fill up statement iii)

Q. What may be the psuedo code for finding the size of a tree?

Q. What is the time complexity of pre-order traversal in the iterative fashion?

Q. What is the space complexity of the post-order traversal in the recursive fashion? (d is the tree depth and n is the number of nodes)

Q. To obtain a prefix expression, which of the tree traversals is used?