Skip to content

Latest commit

 

History

History
15 lines (13 loc) · 675 Bytes

README.md

File metadata and controls

15 lines (13 loc) · 675 Bytes

DataStructure-III-MU-CSE

Codes for Practical experiments of Data Structures (Semester III - Computer Engineering - Mumbai University)

Experiment List:

  1. To implement Stack ADT using array
  2. To convert Infix expression to Postfix expression using Stack ADT
  3. To evaluate Postfix Expression using Stack ADT
  4. To implement Linear Queue ADT using array
  5. To implement Circular Queue ADT using array
  6. To implement Singly linked list ADT
  7. To implement Circular Linked List ADT
  8. To implement Stack using Linked List
  9. To implement Binary Search Tree ADT using Linked List
  10. To implement Graph Traversal techniques: a)Depth First Search and b)Breadth First Search