Skip to content

This repository is a comprehensive collection of fundamental data structure implementations in C programming language. It includes various essential data structures and algorithms like AVL trees, Binary Search Trees (BST), Graph traversals (BFS/DFS), and advanced string matching algorithms.

Notifications You must be signed in to change notification settings

codewithshek/Data-Structures-Problems-Using-C

Repository files navigation

Data Structures Problems Using C

This repository contains various data structure problems implemented in the C programming language. Each folder contains the implementation of a specific data structure or algorithm.

Directory structure:

└── github.com/codewithshek/data-structures-problems-using-c/

├── README.md
├── AVL/
│   └── main.c
├── BFS/
│   └── main.c
├── BST/
│   └── main.c
├── Boyer Moore & Brute Force_/
│   └── main.c
├── Circular Linked List/
│   └── main.c
├── Circular Queue Using Linked List/
│   └── main.c
├── DFS/
│   └── main.c
├── Deque Using Linked List/
│   └── source code
├── Dictionaries/
│   └── main.c
├── HashTable With Linear Probing/
│   └── main.c
├── Heap sort/
│   └── main.c
├── Knuth Morris Pratt Algorithm/
│   └── main.c
├── Polynomial Addition/
│   └── main.c
├── Polynomial Multiplication/
│   └── main.c
└── Priority Queue/
    └── source code

Contents

  • AVL: Implementation of AVL Trees.
  • BFS: Implementation of Breadth-First Search algorithm.
  • BST: Implementation of Binary Search Trees.
  • Boyer Moore & Brute Force: Implementation of Boyer-Moore and Brute Force string matching algorithms.
  • Circular Linked List: Implementation of Circular Linked Lists.
  • Circular Queue Using Linked List: Implementation of Circular Queues using Linked Lists.
  • DFS: Implementation of Depth-First Search algorithm.
  • Deque Using Linked List: Implementation of Deque using Linked Lists.
  • Dictionaries: Implementation of Dictionary data structures.
  • HashTable With Linear Probing: Implementation of Hash Tables with Linear Probing.
  • Heap sort: Implementation of Heap Sort algorithm.
  • Knuth Morris Pratt Algorithm: Implementation of Knuth-Morris-Pratt string matching algorithm.
  • Polynomial Addition: Implementation of Polynomial Addition.
  • Polynomial Multiplication: Implementation of Polynomial Multiplication.
  • Priority Queue: Implementation of Priority Queues.

Getting Started

To get started with any of the implementations, navigate to the respective folder and compile the C files using a C compiler like gcc.

Example:

gcc filename.c -o output
./output

Contributing

Contributions are welcome! Please fork this repository and submit a pull request for any enhancements or bug fixes.

Contact

For any questions or suggestions, please open an issue in this repository.

Contributing

Contributions are welcome! Please fork this repository and submit a pull request for any enhancements or bug fixes.

Contact

For any questions or suggestions, please open an issue in this repository. Can also reach me out through,

Happy Coding !!

About

This repository is a comprehensive collection of fundamental data structure implementations in C programming language. It includes various essential data structures and algorithms like AVL trees, Binary Search Trees (BST), Graph traversals (BFS/DFS), and advanced string matching algorithms.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages