The level of a node X in a binary tree
A) is the length of a shortest path from X to a leaf
B) is the length of a longest path from X to a leaf
C) is the length of the path from the root to X
D) is one more than the level of a child of X

Question

Quizplus · Accepted Answer

The level of a node X in a binary tree is defined as the length of the path from the root to X. Therefore, option C is correct while options A, B, and D are incorrect. Option A defines the height of a node instead of its level. Option B defines the longest path from a node to a leaf, which is also known as the node's height. Option D does not provide a correct definition of the level of a node.

The Level of a Node X in a Binary Tree