Question
Which data structure or concept is best described as an optimization that makes nodes on a find path point closer to the set representative?
Select an option. Your answer will be checked instantly.
Correct Answer: A. Path Compression
Explanation:
Path Compression is an optimization that makes nodes on a find path point closer to the set representative.
This description distinguishes it from the other choices.
Leave a Reply