Codes for Practical experiments of Data Structures (Semester III - Computer Engineering - Mumbai University)
Experiment List:
- To implement Stack ADT using array
- To convert Infix expression to Postfix expression using Stack ADT
- To evaluate Postfix Expression using Stack ADT
- To implement Linear Queue ADT using array
- To implement Circular Queue ADT using array
- To implement Singly linked list ADT
- To implement Circular Linked List ADT
- To implement Stack using Linked List
- To implement Binary Search Tree ADT using Linked List
- To implement Graph Traversal techniques: a)Depth First Search and b)Breadth First Search