UGC NET CSE | July 2018 | Part 2 | Question: 22

Question

Consider the array A=<4, 1, 3, 2, 16, 9, 10, 14, 8, 7>. After building heap from the array A, the depth of the heap and the right child of max-heap are ______ and _____ respectively (Root is at level 0).

• A. 3, 14
• B. 3, 10
• C. 4, 14
• D. 4, 10

Comments

16,14,10,4,7,3,9,1,8,2 is the max heap formed and height is 3, right child is 10

Answer 1

Option (2) 3,10      

Comments

Can you please provide the resource from where you have studied that "a tree in which every node has 0 or 2 children, we consider not only the leaf nodes as the children but the internal nodes also" ?

---

In computer science, a binary tree is a tree data structure in which each node has at most two children, which are referred to as the left child and the right child.

https://en.m.wikipedia.org/wiki/Binary_tree

---

Thanks

Answer 2

Answer is (2). 3,10

This is max heap and right of root is 10.

The depth is no. of edge from root to given node so depth is 3

Answer 3

 

Caption

option b) is correct