# Data Structure Course using C Language

Hello guys, welcome to Data Structure Course using C Language. Here you will find all the posts of the data structure.

- Arrays and Lists
- Introduction
- Basic Terminology
- Elementary Data Organization
- Data Structure Operations
- Abstract Data Type (ADT)
- Algorithm Complexity
- Time-Space trade-off

- Array
- Array Definition
- Representation and Analysis
- Single and MultiDimensional array

- Applications of Array
- Sparse Metrices

- Lists
- Applications of Lists
- Polynomial Representation and Addition

- Introduction
- Stack and Queue
- Stack
- Application of Stack
- Conversion of Infix to Prefix and PostFix Expression
- Recursion

- Queue
- Representation and Implementation of Queue
- Circular Queue
- Deque
- Priority Queue

- Tree
- Binary Tree
- Basic Terminology
- Binary Tree Representation
- Complete Binary Tree
- Extended Binary Tree
- Binary Tree Traversals

- Binary Search Trees
- Binary Search Tree
- AVL Trees
- B-Trees

- Binary Tree
- Graphs
- Graphs: Basic Terminology and Representation
- Graphs and MultiGraphs
- Directed Graphs
- Adjacency Matrices
- Graph Traversal
- Spanning Trees
- Minimum Cost Spanning Trees

- Searching, Sorting, and File Structures
- Searching
- Sorting
- File Structure
- Physical Storage Media File Organization
- Organization of Records into Blocks
- Sequential Files
- Indexing and Hashing
- Primary Indices
- Secondary Indices
- Multi-level Indexing

- Experiments
- Write a Program to implement the array operations
- Write a program to implement the stack and its operations
- WAP to implement Stack application: Tower of Hanoi
- WAP to implement Queue and Its operations
- WAP to implement the circular queue and its operation
- WAP to implement the dequeue and its operation
- WAP to implement the Linked list and its operation
- WAP to implement the BST
- WAP to implement the BST insertion process
- WAP to implement the Insertion sort
- WAP to implement the Bubble sort
- WAP to implement the Quick sort
- WAP to implement the Merge sort
- WAP to implement the Heap sort
- WAP to implement the Graph