+1 vote
in Data Structures & Algorithms I by (110k points)
How many child nodes does each node of K-ary Tree contain?

(a) 2

(b) 3

(c) more than k

(d) at most k

Origin of the question is K-ary tree topic in division Trees of Data Structures & Algorithms I

I have been asked this question in an online interview.

1 Answer

+1 vote
by (672k points)
Correct option is (d) at most k

The explanation is: Each node of K-ary tree contains at most k nodes. While tree with 2 nodes is called Binary tree and tree with 3 nodes is called 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.