+1 vote
in Data Structures & Algorithms I by (110k points)
Who is the ancestor of Node H?

(a) D

(b) F

(c) H

(d) A

Query is from K-ary Tree in section Trees of Data Structures & Algorithms I

This question was addressed to me during an internship interview.

1 Answer

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

The best explanation: Ancestor node is a node that comes in between the path from the node to the root. Since Node D comes between node H and root, so Node D is called the ancestor 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

...