If anyone has experience with Union By Rank and Path Compression or knows of resources that provide clear examples and explanations, I would greatly appreciate your assistance.

Also problems on CF related to it (if any).

Was waiting for the competitions! But found this, and now I'm disappointed. "After more than 10 years of Kick Start, it's time to say goodbye. While Kick Start and Coding Practice with Kick Start will not continue as planned, we invite you to participate in our Code Jam | Kick Start Farewell Round on Saturday, April 15 at 14:00 UTC.

The Farewell Round will consist of 4 concurrent rounds with Code Jam and Kick Start-style problems of different levels of difficulty." ye dukh kaahe khatam ni hota

Which of the following offers better overall complexity in terms of both time and space (Java)

a). 2 ArrayDeque structures

or

b). a Single TreeMap ?

Can you provide some guidance on this?

I was trying to solve 1793C - Dora and Search in the Codeforces Round 852 (Div. 2) with both options, I passed all the test cases using a TreeMap, but it seems to have memory size of 15100 KB. Can you guys help in evaluating complexities and suggesting which of them is better?