+1 vote
in Data Structures & Algorithms I by (110k points)
When executing a sequence of Unions, a node of rank r must have at least 2^r descendants.

(a) true

(b) false

My question comes from Trees in section Trees of Data Structures & Algorithms I

I have been asked this question in an interview for job.

1 Answer

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

The best explanation: By the induction hypothesis, each tree has at least 2^r – 1 descendants, giving a total of 2^r and establishing the lemma.

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

...