Data Structures Lab using C++ 1. Implementation of Arrays (Single and Multi-Dimensional) 2.

Polynomial Object and necessary overloaded operators. 3. Singly Linked Lists. 4. Circular Linked Lists. 5. Doubly Linked Lists. 6. General Lists. 7. Implementation of Stack (using Arrays) 8. Implementation of Queue (Using Pointers) 9. Implementation of Circular Queue (using Arrays and Pointers) 10. Evaluation of Expressions- ITP (Infix to Prefix). 11. Binary Tree implementations and Traversals using recursion. 12. Binary Search Trees. 13. Shortest path (Dijkstra’s) 14. Search methods in graphs (DFS & BFS) using recursion.

Sign up to vote on this title
UsefulNot useful