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

(a) True

(b) False

I would like to ask this question from Ternary Tree topic in division Trees of Data Structures & Algorithms I

I have been asked this question in my homework.

1 Answer

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

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

...