Welcome to the Data Structures & Operations repository! This repository contains Java implementations of various data structures and their associated operations. It is designed for students, developers, and anyone interested in understanding and working with data structures in Java.
This repository provides Java implementations of fundamental data structures such as Arrays, Linked Lists, Stacks, Queues, Trees, Graphs, and more. Each data structure comes with basic operations (e.g., insertion, deletion, traversal) and, in some cases, more advanced algorithms (e.g., sorting, searching, graph traversal algorithms).
Note: This repository is a work in progress and is not yet completed. The code and documentation are subject to changes as new features and improvements are added. While the current implementations are functional, some data structures and operations may still be under development. Please use the code with caution and feel free to contribute if you have suggestions or improvements.
- Add Arrays section
- Add Linked Lists section
- Add Stacks section
- Add Queues section
- Add Trees section
- Add Graphs section
- Add Hashing section
- Java
The following data structures are implemented in this repository:
- Arrays
- Dynamic Array
- 2D Arrays
- Linked Lists
- Singly Linked List
- Doubly Linked List
- Circular Linked List
- Stacks
- Stack using Array
- Stack using Linked List
- Queues
- Queue using Array
- Queue using Linked List
- Circular Queue
- Priority Queue
- Trees
- Binary Tree
- Binary Search Tree (BST)
- AVL Tree
- Heap (Min-Heap, Max-Heap)
- Graphs
- Adjacency Matrix
- Adjacency List
- Depth-First Search (DFS)
- Breadth-First Search (BFS)
- Hashing
- Hash Table
- Hash Map
To run the code in this repository, you need to have Java Development Kit (JDK) installed on your machine. You can download it from here.
git clone https://github.com/odhithSen/data-structures-java.git
cd data-structures-javajavac DataStructureExample.java
java DataStructureExamplePlease review the license