What is the difference between `HashMap` and `TreeMap`?
`HashMap` does not maintain any order, while `TreeMap` maintains the elements in sorted order based on their keys.
Nice job! Youâ€™ve clearly explained the difference in order preservation.
Can you explain how `TreeMap` determines the order of keys and what happens if the keys are not comparable?