https://github.com/hiteshpatil2005/data-structures-algorithm

Welcome to the DSA Repository👨🏻‍💻! This repository contains a comprehensive collection of code examples, implementations, and explanations for various Data Structures and Algorithms (DSA). Whether you're a beginner looking to learn the basics or an experienced programmer wanting to brush up on your skills, this repository has something for you.
https://github.com/hiteshpatil2005/data-structures-algorithm

algorithms applications c dsa-learning-series java

Last synced: 4 months ago
JSON representation

Welcome to the DSA Repository👨🏻‍💻! This repository contains a comprehensive collection of code examples, implementations, and explanations for various Data Structures and Algorithms (DSA). Whether you're a beginner looking to learn the basics or an experienced programmer wanting to brush up on your skills, this repository has something for you.

• Host: GitHub
• URL: https://github.com/hiteshpatil2005/data-structures-algorithm
• Owner: hiteshpatil2005
• Created: 2024-06-19T17:25:16.000Z (almost 2 years ago)
• Default Branch: main
• Last Pushed: 2025-06-09T04:08:46.000Z (about 1 year ago)
• Last Synced: 2025-10-23T16:47:30.414Z (8 months ago)
• Topics: algorithms, applications, c, dsa-learning-series, java
• Language: Java
• Homepage:
• Size: 1.43 MB
• Stars: 4
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • Roadmap: Roadmap/DSA Roadmap.pdf

Awesome Lists containing this project

README

          


    





  



Welcome to the DSA Repository📈! This repository contains various Data Structures and Algorithms implementations in different programming languages. Whether you are a beginner looking to understand the basics or an advanced learner aiming to refine your skills, this repository has something for everyone.


### Languages 💡

![Java](https://img.shields.io/badge/java-%23ED8B00.svg?style=for-the-badge&logo=openjdk&logoColor=white)

![C](https://img.shields.io/badge/c-%2300599C.svg?style=for-the-badge&logo=c&logoColor=white)

### Repository Strucutre 📂📂

```

Data-Structures-Repository

├── C

│   ├── Linked_List

│   │   ├── Doubly_linked_list

│   │   │   └── Doubly_linked_list_program.c

│   │   ├── Singly_Linked_List

│   │   │   ├── Simple_linked_list.c

│   │   │   └── Singly_linked_list.c

│   │   └── Stack_using_singly_link_list.c

│   ├── Queue

│   │   ├── Circular_queue.c

│   │   └── Queue_operation.c

│   ├── Searching

│   │   ├── Binary_search.c

│   │   └── Linear_search.c

│   ├── Sorting Algorithms

│   │   ├── Bubble_sort.c

│   │   ├── Insertion_sort.c

│   │   └── Selection_sort.c

│   └── Stack

│       ├── applications_of_stack

│       └── stack_operations.c

├── Java

│   ├── Graphs

│   │   ├── BFS.java

│   │   ├── DFS.java

│   │   ├── Dijkstra.java

│   │   ├── Graph.java

│   │   ├── Kruskal.java

│   │   └── Prims_Algorithm.java

│   ├── Hash Table

│   │   ├── Chaining.java

│   │   └── HashTable.java

│   ├── Heap

│   │   ├── HeapSort.java

│   │   └── PriorityQueue.java

│   └── Trees

│       ├── BinarySearchTree.java

│       ├── BinaryTree.java

│       └── HuffmanTree.java

├── Roadmap

│   └── DSA Roadmap.pdf

├── img

└── README.md

```

  

## Table of Contents ⬇️⬇️

  

    Searching Algorithm

    1. Linear Search 
 2. Binary Search

  

  

    Sorting Algorithm

    1. Bubble Sort 
 2. Insertion Sort 
 3. Selection Sort

  

  

    Stack

    Stack Operations :
 1. Push 
 2. Pop 
 3. Peek 
 4. Display

  

  

    Stack Applications

    1. Balancing of Parenthesis 
2. Decimal to Binary conversion 
 3. Evaluation of Postfix operation

  

  

    Queue

    1. Queue Operations 
 2. Circular Queue

  

  

    Link List

    1. Singly Link List 
 2. Doubly Link List

  

  

    Trees

    1. Binary tree operations 
 2. Binary Search Tree Operations 
 3. Huffman Implementation

  

  

    Graphs

    1. Graph Implementation 
 2. Kruskal Algorithm 
 3. Prims Algorithm 
 4. Breath First Search(BFS) 
 5. Depth First Search(DFS) 
 6. Dijkstra's Algorithm 

  

     

    Hash Table

    1. Hash Table(Linear Probing) 
 2. Chaining 

  

    

    Heap

    1. Heap Sort 
 2. Priority Queue 

  

## How to Contribute

We welcome contributions from the community! If you have an algorithm or data structure that you would like to add, please:

1. Fork the repository

2. Create a new branch (`git checkout -b feature/your-feature`)

3. Commit your changes (`git commit -m 'Add some feature'`)

4. Push to the branch (`git push origin feature/your-feature`)

5. Create a new Pull Request