The longest path from the origin node to the terminal node is called ?
(A) Minimal path
(B) Efficient path
(C) Index path
(D) Critical path
Answers
Answered by
8
Answer:
In a tree data structure, the total number of edges from leaf node to a particular node in the longest path is called as HEIGHT of that Node. In a tree, height of the root node is said to be height of the tree. In a tree, height of all leaf nodes is '0'.
Similar questions