This repository contains implementations of various data structures and algorithms in C and JavaScript.

"First, solve the problem. Then, write the code."
– John Johnson

1. Data Structures
2. Algorithms
3. Notes
4. Usage
5. Contributing
6. Contributors
7. License

• Linked List
  • Singly Linked List
  • Doubly Linked List
  • Circular Linked List
• Stack
  • Infix to Postfix & Prefix
  • Parenthesis Matching
  • Evaluation of Postfix & Prefix
• Queue
  • Priority Queue using Linked List & Array
  • Queue using Array
  • Queue using Linked List
  • Queue using Two Stacks
• Tree
  • Binary Tree
  • Binary Search Tree (BST)
  • AVL Tree
• Heap
  • Min Heap
  • Max Heap
  • Heap Operations (Insert, Delete, Heapify)
• Hashing
  • Hashing with Chaining
  • Hashing with Linear Probing
  • Hashing with Quadratic Probing
  • Hashing with Double Hashing

• Sorting Algorithms
• Recursion
• Searching Algorithms

• Recursion Types: Tail & Head

To run the C programs:

1. Open the file in Visual Studio Code.
2. Use the built-in terminal to compile and run the program. Example: gcc filename.c -o outputname ./outputname

Contributions are welcome! Please feel free to submit a Pull Request.

Before merging any changes, make sure to create a pull request and have it reviewed by the repository maintainers. Only merge once all the reviews are completed and approved.

Faisal786111 (Faisal Khan) 💻

Haruu4304 (Harsha Surwase) 🎨 💻

AkshitShah96 (Akshit Shah) 🎨 💻

MIT License

Copyright (c) 2024 Faisal786111