Package topics.introduction.examples

package topics.introduction.examples

Worked examples illustrating core Java data-structure APIs.

Each class in this package demonstrates one Java Collections Framework type, showing its construction, common operations, and typical use-cases — making them useful as quick reference snippets.

Classes in This Package

• ArrayDequeExample — double-ended queue as stack/queue
• ArrayListExample — resizable array list
• HashSetExample — unordered set with O(1) lookup
• LinkedHashSetExample — insertion-ordered set
• LinkedListExample — doubly linked list
• PriorityQueueExample — min-heap priority queue
• StackExample — LIFO stack
• TreeSetExample — sorted set (red-black tree)
• VectorExample — legacy thread-safe list

Related Packages

Package	Description
topics.introduction	Introduction to algorithms, computational thinking, and fundamental data structures.

Classes

Class	Description
ArrayDequeExample	Demonstrates ArrayDeque as both a queue (FIFO via add/poll) and a stack (LIFO via push/pop).
ArrayListExample	Demonstrates basic ArrayList operations: add, remove, and iteration.
HashSetExample	Demonstrates HashSet operations: add, remove, and contains.
LinkedHashSetExample	Demonstrates LinkedHashSet operations.
LinkedListExample	Demonstrates LinkedList as a doubly-linked list with operations at both ends: addFirst, addLast, removeFirst, and removeLast.
PriorityQueueExample	Demonstrates PriorityQueue with natural ordering.
StackExample	Demonstrates the legacy Stack class (LIFO) with push and pop operations.
TreeSetExample	Demonstrates TreeSet with natural sorted ordering.
VectorExample	Demonstrates the legacy thread-safe Vector collection.