Greetings, aspiring coders! Today, we're going to delve deep into the complexities of data structures, specifically the TreeSet from Java's Collection Framework, and explore how to handle queries efficiently. This is a common problem, often encountered in numerous data science and algorithmic problems. So let's gear up to unravel the mysteries of TreeSet operations and get our hands dirty with some interactive problem-solving!

Before delving into the task, let's understand what a TreeSet is and why we would use it. TreeSet is a data structure in Java's Collection Framework that stores unique elements while maintaining sorted order.

Advantages of using TreeSet:

1. Extracting the minimum (using first()) or maximum (using last()) values will be a constant-time operation, i.e., $O(1)$, as they are always at the start or end of the set.