A collection of datastructures implemented in C and C++
Datastructures implemented:
- Single Linked List
- Doubly Linked List
- Tries
- AVL Trees
- Stack using Linked List
- Circular Queues using Array
- Graph
- Min Heap
Algorithms:
- Find middle of Linked List in one pass
- Infix to Postfix conversion of expression
- Reverse of Linked List
- Merge Sort
- Merge Sort on Linked Lists
- Simple bubble sort on Linked Lists by swapping nodes
- Evaluation of Postfix expression
- Quicksort
- Find all permutations
- Huffman encoding
- Dijkstra's Algorithm
- Evaluation of Infix Expression