+1 vote
in Data Structures & Algorithms I by (110k points)
The number of edges from the node to the deepest leaf is called _________ of the tree.

(a) Height

(b) Depth

(c) Length

(d) Width

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

The question was asked in an interview for internship.

1 Answer

+1 vote
by (737k points)
selected by
 
Best answer
The correct option is (a) Height

To explain: The number of edges from the node to the deepest leaf is called height of the tree.

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

...