How many strategies are followed to solve a dynamic equivalence problem?

Category: QuestionsHow many strategies are followed to solve a dynamic equivalence problem?
Editor">Editor Staff asked 4 weeks ago

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 Answers
Editor">Editor Staff answered 4 weeks ago

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.