Skip to content

SanthoshD123/Data-Structures

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

55 Commits
object_detection
object_detection
 
 
2-3 Tree implementation .py
2-3 Tree implementation .py
 
 
2-3-4 Tree .python
2-3-4 Tree .python
 
 
AVL tree .py
AVL tree .py
 
 
AVL tree insertion and deletion .py
AVL tree insertion and deletion .py
 
 
Add two numbers in linked list .py
Add two numbers in linked list .py
 
 
All linked list insertion .py
All linked list insertion .py
 
 
B+ tree implementation .py
B+ tree implementation .py
 
 
BST from preorder .py
BST from preorder .py
 
 
Binary tree .py
Binary tree .py
 
 
Circular linked list .py
Circular linked list .py
 
 
Coin change problem using greedy method .py
Coin change problem using greedy method .py
 
 
Count leaf node in binary tree .py
Count leaf node in binary tree .py
 
 
Create and display linked list .py
Create and display linked list .py
 
 
Display Circular Linked List.java
Display Circular Linked List.java
 
 
Doubly linked list .py
Doubly linked list .py
 
 
Dynamic array as parameter .cpp
Dynamic array as parameter .cpp
 
 
Find and print middle of Linked List.java
Find and print middle of Linked List.java
 
 
Heapify implementation .py
Heapify implementation .py
 
 
Heapq .py
Heapq .py
 
 
Huffman coding .py
Huffman coding .py
 
 
Insert In Sorted Linked List.java
Insert In Sorted Linked List.java
 
 
Intro sort .py
Intro sort .py
 
 
Iterative preorder traversal .py
Iterative preorder traversal .py
 
 
Length of Circular Linked List.java
Length of Circular Linked List.java
 
 
Linked List Insertion At Position.java
Linked List Insertion At Position.java
 
 
Linked list palindrome .py
Linked list palindrome .py
 
 
Matrix interchange .py
Matrix interchange .py
 
 
Nth node from end of linked list .java
Nth node from end of linked list .java
 
 
Preorder traversal .py
Preorder traversal .py
 
 
Priority Queue .py
Priority Queue .py
 
 
Quickselect .py
Quickselect .py
 
 
README.md
README.md
 
 
Red-Black tree .py
Red-Black tree .py
 
 
Remove duplicate element from sorted Linked .java
Remove duplicate element from sorted Linked .java
 
 
Remove duplicates from sorted LL .py
Remove duplicates from sorted LL .py
 
 
Remove nth node from end of list .py
Remove nth node from end of list .py
 
 
Reverse a linked list .java
Reverse a linked list .java
 
 
Rotate matrix .py
Rotate matrix .py
 
 
Tim sort .py
Tim sort .py
 
 
Topological Sort Implementation .py
Topological Sort Implementation .py
 
 
check for balanced parenthesis in string .java
check for balanced parenthesis in string .java
 
 
count distinct elements using HashSet .java
count distinct elements using HashSet .java
 
 
decimal to binary conversion using recursion .java
decimal to binary conversion using recursion .java
 
 
factorial using recursion .java
factorial using recursion .java
 
 
frequencies of array elements using HashMap .java
frequencies of array elements using HashMap .java
 
 
insert in stack .java
insert in stack .java
 
 
merge two sorted array .java
merge two sorted array .java
 
 
plots.ipynb
plots.ipynb
 
 
print n to 1 using recursion .java
print n to 1 using recursion .java
 
 
structures .cpp
structures .cpp
 
 

Repository files navigation

Data Structures and Algorithms

A comprehensive collection of data structures and algorithms implementations in multiple programming languages (Python, Java, and C++). This repository serves as both a learning resource and reference implementation for various computer science concepts.

Repository Contents

Tree Data Structures

  • Binary Trees
    • Binary Tree implementation
    • BST from preorder traversal
    • Count leaf nodes in binary tree
    • Preorder traversal (iterative and recursive)
  • Balanced Trees
    • AVL Tree (with insertion and deletion)
    • Red-Black Tree
    • 2-3 Tree
    • 2-3-4 Tree
    • B+ Tree
  • Heap Implementations
    • Heapify implementation
    • Heapq usage

Linked Lists

  • Singly Linked Lists
    • Creation and display
    • Insertion operations (at position, sorted)
    • Palindrome check
    • Remove duplicates
    • Remove nth node from end
    • Find middle of linked list
  • Doubly Linked Lists
    • Implementation
  • Circular Linked Lists
    • Implementation and operations

Sorting Algorithms

  • Advanced Sorting
    • Intro Sort
    • Tim Sort
    • Quickselect
  • Graph Algorithms
    • Topological Sort

Other Data Structures

  • Stacks
    • Implementation
    • Balanced parenthesis checker
  • Priority Queues
    • Implementation

Algorithmic Techniques

  • Recursion
    • Factorial calculation
    • Decimal to binary conversion
    • Print n to 1
  • Greedy Algorithms
    • Coin change problem
  • Data Compression
    • Huffman coding

Matrix Operations

  • Matrix interchange
  • Matrix rotation

Miscellaneous

  • Dynamic array as parameter (C++)
  • Structures in C++
  • HashSet and HashMap usage
  • Array operations

Languages Used

  • Python: Primary language for most implementations
  • Java: Several implementations, especially for fundamental data structures
  • C++: Used for some lower-level implementations

Getting Started

  1. Clone this repository
  2. Navigate to the implementation you're interested in
  3. Each file is self-contained and can be run independently

Usage

The implementations can be used for:

  • Learning data structures and algorithms
  • Preparing for coding interviews
  • Reference for implementing these concepts in your own projects
  • Understanding the time and space complexity of different approaches

License

This repository contains implementations created for educational purposes.

Contribution

Contributions are welcome! Feel free to add new implementations, improve existing ones, or fix bugs.

About

No description, website, or topics provided.

Resources

Readme
Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages