This repository contains all the data structure codes for End Semester Examination.
All the codes are in C programming language.
- infix to postfix
- infix to prefix
- postfix evaluation
- prefix evaluation
- palindrome using stack
- stack using linked list
- balanced parenthesis
- queue implementation using Array
- queue implementation using linked list
- circular queue using Array
- deque using Array
- priority queue using linked list
- singly-linked list
- doubly-linked list
- circular-linked list
- polynomial addition using linked list
- reversing linked list using stack
- Depth First Search
- Breadth First Search
- Binary Search Tree
- Binary tree operations
- Tree traversal
- Height of tree
- Mirroring of Tree
- Internal, External & Total nodes
- Heap - Insertion, Deletion and Heapify
- Heap Sort
- Linear Search
- Binary Search
- Binary Search using Recursion
- Index Sequential Search
- Bubble Sort
- Selection Sort
- Insertion Sort
- Merge Sort
- Quick Sort
Feel free to fork this repository and submit pull requests if you have suggestions for optimizations or alternative solutions.
Feedback is always welcome!
📧 Contact - dynaster21@gmail.com
If you have any questions or suggestions, please don't hesitate to reach out.