Application of Stack
- Expression Evolution
- Expression conversion
- Parsing
- Simulation of recursion
- Fuction call
Expression Representation
| Infix | Prefix | Postfix |
|---|---|---|
| a + b | + a b | a b + |
| a + b * c | + a * b c | a b c * + |
| (a + b) * (c - d) | * + a b - c d | a b + c d - * |
Data Structure
Introduction
Linked List
Singly Linked List
- Creation of linked list
- Insertion in linked list
- Insertion in beginning
- Insertion in location
- Deletion in linked list
- Deletion Of First Node
- Deletion Of Last Node
- Searching in linked list
- Sorting in linked list
Doubly Linked List
- Doubly linked list
- Insertion in Doubly....
- Insertion in beginning Dou..
- Insertion in location doubly..
- Insertion in last doubly..
Circular Linked List
- Circular Linked List
- Insertion in Circular Linked List
- Insertion in beginning Circular
- Insertion in Location Circular...
- Insertion in last Circular link...
- Deletion in Circular Linked List
- Deletion at Beginning in Circu...
- Deletion at Location in Circular...
- Deletion at Last in Circular...
Stack
- Stack
- Static stack
- Dynamic Stack
- Application of stack
- Infix to Postfix Conversion
- Infix to Prefix Conversion
- Postfix to Infix Conversion
- Prefix to Infix Conversion
- Prefix Infix Postfix converter
Queues
Recursion
Searching
Sorting Algorithms
- Bubble Sort
- Insertion sort
- Quick Sort
- Heap sort
- Merge sort
- Counting sort
- Radix sort
- Bucket sort
- complexity of sorting algorithms
Algorithms
- Breadth First Search
- Prim's Algorithm
- Kruskal's Algorithm
- Dijkstra's Algorithm
- Bellman-ford Algorithm
- Activity selection
- Huffman Coding