DSAL Lab Assignments

This repository contains codes for Data Structures and Algorithms Laboratory (DSAL) assignments. Each folder corresponds to an individual assignment. Click on the links below to access the respective code and resources.

---

Assignments

1. Assignment 1: Binary Tree (BT)
   Implementation of a basic Binary Tree and its operations.

2. Assignment 2: Binary Search Tree (BST)
   Implementation of a Binary Search Tree with insertion, deletion, and traversal.

3. Assignment 3: Threaded BST
   Implementation of a Threaded Binary Search Tree.

4. Assignment 4: Hash Table Implementation
   Hash Table implementation using closed addressing.

5. Assignment 5: Open Hashing
   Implementation of Open Hashing.

6. Assignment 6: BFS and DFS Traversal in Graph
   Breadth-First Search and Depth-First Search traversal on graphs.

7. Assignment 7: Prim's or Kruskal (Prim's is easy)
   Implementation of Prim's or Kruskal's algorithm for finding Minimum Spanning Tree.

8. Assignment 8: OBST (Optimal BST)
   Implementation of Optimal Binary Search Tree (OBST).

9. Assignment 9: AVL Tree
   Implementation of AVL Tree with rotations.

10. Assignment 10: Heap Sort
    Implementation of Heap Sort algorithm.

11. Assignment 11: Sequential File
    Working with sequential file operations.

12. Assignment 12: Direct Access File
    Implementation of direct access file operations.

---