- Data Structure Introduction
- Data Structure Types
- Data Structure Arrays
- Singly Linked List
- Bubble Sort
- Binary Tree
- Binary Search Tree
- Array vs Linked List
- Stack vs Queue
- Binary Tree vs Binary Search Tree
- Queues
- Lenear Search
- Binary Search
- Stack
- Merge Sort
- Heap Sort
- Quick Sort
- Doubly Linked List
- Cirular Linked List
- Circular Queue
- Avl Tree
- Bucket Sort
- Selection Sort
- Insertion Sort
Singly Linked List.
A singly linked list, is a type of linked list that is unidirectional, that is, it can be traversed in only one direction from head to the last node (tail). Each element in a linked list is called a node. A single node contains data and a pointer to the next node which helps in maintaining the structure of the list.