+1 vote
in Data Structures & Algorithms I by (110k points)
How many strategies are followed to solve a dynamic equivalence problem?

(a) 1

(b) 2

(c) 3

(d) 4

Asked question is from Trees in section Trees of Data Structures & Algorithms I

The question was asked in an internship interview.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
Right choice is (b) 2

The best I can explain: There are two strategies involved to solve a dynamic equivalence problem- executing find instruction in worst-case time and executing union instruction in worst-case time.

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.