Node:
classDiagram
class Node {
data
next
}
Linked List:
graph LR
A[Head] --> B[Node]
B --> C[Node]
C --> D[Node]
D --> E[Node]
E --> F[Node]
F --> G[Node]
- Singly Linked List
- Singly Linked List Operations
- Singly Linked List Operations Optimized -> Some operations are optimized to O(1) time complexity. Example. Adding a node to the end of the list, length of the list.
- Rotate Linked List
- Fast and Slow Pointer
- Identifying Cycles
- Floyd Cycle
