Core Java - Collections & Inner or Nested Classes

Explore traditional data structures, focusing on arrays and linked lists, their memory layouts, access patterns, and the trade-offs between size constraints and dynamic growth.

Array list and linked list store duplicates and maintain insertion order, but array list uses an array while linked list uses a doubly linked list, influencing deletion, growth, and access.

Explore java collections and their data structures, enabling operations like retrieving, searching, updating, and deleting, with implementations like array list, link list, hash map, tree map, and tree set.

Explore the Java collection hierarchy and framework, where list and set interfaces extend collection, with array list, linked list, hash map, and tree map, and maps store key-value pairs.

Explore the characteristics of a Java list: it stores duplicates, preserves insertion order, and supports forward and backward traversal, as seen in array list and linked list.

Compare ArrayList and LinkedList through generics, adding, removing, and iterating elements, including addAll and enhanced for loops; explore LinkedList specific methods like peek and pop and a product example.

Discover how the collections class provides static utility methods to operate on lists, sets, maps including reverse, shuffle, search, min, max, frequency, and unmodifiable or synchronized views.

Explore the characteristics of set in collections, highlighting no duplicates, no insertion order, and one-direction traversal. Understand set as a collection interface with predefined implementations, including hash set.

Explore hashset and treeset as sets, highlighting hashing, insertion order, and sorted storage, and learn to use generics, iterators, and custom objects with hashCode and equals.

Explore maps as key–value collections where keys and values are objects. Compare hash map and tree map implementations, and note that map is an interface not extended from collection interface.

explore hash map and tree map usage by storing key-value pairs, retrieving with get, and iterating via entry sets, while understanding duplication, sorted keys, and when to prefer tree map.