SDE - 2

Bob has been given a binary tree having N nodes. He has been asked to check if all the leaf nodes are at the same level.

Your task is to help Bob in checking if all the leaf nodes are at the same level or not. Return true if all the leaf nodes are at the same level otherwise return false.

A binary tree is a hierarchical data structure in which each node has at most two children.

Any node whose left and right child are null is called a leaf node in a binary tree.

Example:

Consider the given binary tree:

For the given tree the leaf nodes are 5, 4, 7, 6. All these nodes are on the same level. So the output will be True. 

He asked the  questions from1) basic Java and advanced Java . 2) database query and some of the concept.3) OOPS concept4) Question related to project that you have mentioned.

There is a room with a door (closed) and three light bulbs. Outside the room, there are three switches, connected to the bulbs. You may manipulate the switches as you wish, but once you open the door you can’t change them. Identify each switch with its bulb. All bulbs are in working condition