+1 vote
in Data Structures & Algorithms I by (110k points)
In the Union/Find algorithm, the ranks of the nodes on a path will increase monotonically from?

(a) leaf to root

(b) root to node

(c) root to leaf

(d) left subtree to right subtree

Question is taken from Trees in section Trees of Data Structures & Algorithms I

This question was addressed to me in my homework.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
Right choice is (a) leaf to root

To explain: One of the lemmas state that, in the Union/Find algorithm, the ranks of the nodes on a path will increase monotonically from leaf to root.

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

...