UGCNET-July-2018-II-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

Answer 1

Option (2) 3,10      

Comments

How 10 is a right child? Shouldn't the right child be 9

---

9 and 10 both are right children of the tree but according to the given options, we need to choose 10

---

Mam in the children we doesn't have any outgoing edge but 10 has an outgoing edge

---

10 is the right child with respect to the root.When we say 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.correct me if I am wrong

---

Mam internal node is not same as leaf node

---

Where did I mention that it's the same?

---

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

 

Caption

option b) is correct