+1 vote
in Data Structures & Algorithms I by (110k points)
What should be the condition for the level of a left node?

(a) It should be less than or equal to that of its parent

(b) It should be greater than that of its parent

(c) It should be strictly less than that of its parent

(d) The level should be equal to one

My enquiry is from Binary Trees topic in portion Binary Trees of Data Structures & Algorithms I

I got this question by my college director while I was bunking the class.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
The correct choice is (c) It should be strictly less than that of its parent

For explanation: The level of a left node should be strictly less than that of its parent. The level of a right node is less than or equal to that of its parent.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.

Categories

...