+1 vote
in Data Structures & Algorithms I by (110k points)
Can child node be always called Leaf node in the K-ary tree?

(a) True

(b) False

The above asked question is from K-ary Tree in section Trees of Data Structures & Algorithms I

This question was posed to me in an interview for internship.

1 Answer

+1 vote
by (737k points)
selected by
Best answer
Right choice is (b) False

Easiest explanation - Leaf node is any node that does not contain any children. Child node may or may not contain more nodes. Child node will only be called leaf Node if the node has no child node.

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.