+1 vote
in Data Structures & Algorithms I by (110k points)
Which node is the Leaf node in the following K-ary tree?

(a) A

(b) B

(c) D

(d) F

My question comes from K-ary tree in chapter Trees of Data Structures & Algorithms I

I have been asked this question by my college director while I was bunking the class.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
The correct choice is (d) F

Explanation: Leaf node is any node that does not contain any children. Since Node F is the node without any children, So F is called Leaf Node. While Node A is root node and Node B, Node C, Node D is parent node of their children.

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

...