Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/limajpp/data-structures
This repository contains implementations of various fundamental data structures written in Java. Each implementation is designed from scratch, avoiding the use of Java's built-in data structure libraries, to reinforce a deeper understanding of how they work internally.
https://github.com/limajpp/data-structures
algorithms data-structures java
Last synced: about 1 month ago
JSON representation
This repository contains implementations of various fundamental data structures written in Java. Each implementation is designed from scratch, avoiding the use of Java's built-in data structure libraries, to reinforce a deeper understanding of how they work internally.
- Host: GitHub
- URL: https://github.com/limajpp/data-structures
- Owner: limajpp
- Created: 2024-12-16T02:44:06.000Z (about 1 month ago)
- Default Branch: main
- Last Pushed: 2024-12-16T03:35:33.000Z (about 1 month ago)
- Last Synced: 2024-12-16T04:25:59.096Z (about 1 month ago)
- Topics: algorithms, data-structures, java
- Language: Java
- Homepage:
- Size: 14.6 KB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
Overview:
This repository contains a collection of fundamental data structures implemented in Java. Each data structure is built from scratch, avoiding Java's built-in collections, to ensure a deep understanding of how these structures work internally. These implementations are ideal for students, developers preparing for coding interviews, or anyone looking to strengthen their computer science fundamentals.Features
-
DoublyLinkedList: A linked list where each node points to both its previous and next nodes. -
DynamicStack: A stack implementation that dynamically adjusts its capacity as elements are pushed or popped. -
HashTable: Key-value storage using hashing for efficient lookups. -
LinkedList: A singly linked list implementation supporting insertion, deletion, traversal, and search operations. -
List: A general linear data structure offering sequential access to elements. -
Queue: A First-In-First-Out (FIFO) implementation with enqueue and dequeue operations. -
Stack: A Last-In-First-Out (LIFO) data structure supporting push, pop, and peek operations. -
UnorderedPriorityQueue: A priority queue implementation without strict ordering rules for insertion.