All Classes and Interfaces

Classes

Class	Description
CircularLinkedList<T>	A circular doubly linked list implementation where the last node points back to the first node, creating a circular structure that allows continuous traversal in both directions.
CircularNode<T>	Represents a node in a circular linked list.
DoublyLinkedList<T>	A doubly linked list implementation that provides bidirectional traversal and efficient operations at both ends of the list.
DoublyNode<T>	Represents a node in a doubly linked list.
LinkedList<T>	A singly linked list implementation that provides various operations for adding, removing, and accessing elements in a linear sequence.
Node<T>	Represents a node in a singly linked list.