+1 vote
in Data Structures & Algorithms I by (110k points)
Which node is the root node of the following ternary tree?

(a) A

(b) B

(c) C

(d) D

Query is from 1 topic in portion Trees of Data Structures & Algorithms I

I have been asked this question in an interview.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
Correct choice is (a) A

To explain: Node A is called the root node of the above ternary tree while the Node B, Node C, Node D are called Leaf 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.

Categories

...