Question

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.

Answer 1

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.