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

(a) True

(b) false

My query is from K-ary Tree in division Trees of Data Structures & Algorithms I

This question was posed to me during an interview.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
Right answer is (a) True

Explanation: Leaf node is a node that has no child. Since Leaf node will always be the node on the last level of k-ary tree, so it can be called child node of given parent node in K-ary 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

...