Start here. This is the direct spoken answer to practice first.
Overview
All three implement Map, but they make different promises about iteration and key ordering.
Use HashMap for general key lookup when no iteration order is required. Use LinkedHashMap when iteration must follow insertion order, or access order when configured for patterns such as an LRU-style cache. Use TreeMap when keys must stay sorted or the code needs range and nearest-key operations. TreeMap uses natural ordering or a comparator, so its key comparison must be consistent and meaningful.