+1 vote
in Data Structures & Algorithms I by (110k points)
Which operation is used to combine two auxiliary trees?

(a) Join

(b) Combinatorial

(c) Add

(d) Concatenation

This is a very interesting question from Binary Trees in portion Binary Trees of Data Structures & Algorithms I

The question was posed to me by my college director while I was bunking the class.

1 Answer

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

For explanation: If the top node of one of the reference tree amongst the two, is the is the child of the bottom node of the other reference tree, then the join operation can be carried out to join the two auxiliary trees.

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

...