Data Structure Lab

Experiments: Sorting Techniques — Bubble, Insertion, Selection, Shell, Radix, Quick Sort; Searching and Hashing — Linear Search, Binary Search, Hashing Methods (Modulo Division, Digit Extraction, Fold Shift, Fold Boundary, Linear Probe for Collision Resolution); Stacks — Array and Linked List implementation, Postfix Evaluation, Balancing Parentheses, Infix to Postfix Conversion; Queues — Ordinary Queue (Linked List), Circular Queue (Array), Priority Queue, Double-Ended Queue; Linked Lists — Singly, Circular, Doubly (Insert, Display, Delete, Search, Count, Reverse), Polynomial Addition; Trees — BST Create, Recursive Traversals, Largest/Smallest Node, Node Count, Min/Max Heap, Expression Tree, Heapsort; Graphs — Adjacency Matrix, BFS, Minimum Spanning Tree (Kruskal's/Prim's).