The length of the longest path from the root of a binary tree to a leaf is called
A) the height of the tree
B) the level of the tree
C) the max-path length of the tree
D) the peak length of the tree

Question

Quizplus · Accepted Answer

The length of the longest path from the root of a binary tree to a leaf is commonly known as the height of the tree. Option A fits this definition accurately. Option B, level of the tree, refers to the depth of a given node in the tree. Option C, max-path length of the tree, and Option D, peak length of the tree, are both made up terms that are not commonly used in the field of computer science.

The Length of the Longest Path from the Root of a Binary