Data_Structures_using_C

1. Array ( Polynomial Addition )
2. Stack ( Infix -> Postfix )
3. Stack ( Evaluate Postfix )
4. Linked List ( Stack Implementation )
5. Linked List ( Queue Implementation )
6. Array ( Queue Implementation )
7. Array ( Circular Queue Implementation )
8. Array ( Double Ended Queue Implementation )
9. Singly Linked List
10. Doubly Linked List
11. Singly Circular Linked List
12. Doubly Circular Linked List
13. Linked List ( Binary Search Tree Implementation)
14. Linked List ( AVL Tree Implementation)
15. Linear Search Algorithm
16. Binary Search Algorithm ( Recursive )
17. Bubble Sort Algorithm
18. Insertion Sort Algorithm
19. Merge Sort Algorithm
20. Quick Sort Algorithm
21. Counting Sort Algorithm
22. Adjacency Matrix Implementation
23. Adjacency List Implementation
24. BFS (Breadth First Search) graph traversal Implementation
25. DFS (Depth First Search) graph traversal Implementation
26. Dijkstra’s algorithm Implementation
27. Heap Sort Algorithm