Loading repository data…
Khaled-TE / repository
Educational implementations of core data structures from scratch in Java and Python. Includes a min-heap, custom linked list, custom stack with a min-stack variant, a priority queue built from two stacks, a BST, and a self-balancing AVL tree.
A transparent discovery signal based on current public GitHub metadata.
This score does not audit code, security, maintainers, documentation quality, or suitability. Verify the repository and its current documentation before adoption.
Educational implementations of core data structures, written from scratch in Java and Python — no java.util.PriorityQueue, no heapq, no shortcuts. The goal is to understand each structure by building it.
Java/)| Path | Description |
|---|---|
Heaps/Heaparray.java | Array-backed min-heap with siftUp / siftDown and extractMin. |
LinkedLists/Custom_LinkedList.java | Singly linked list with insert/remove at both ends and in-place reverse. |
Stacks/Custom_Stack.java | Linked-list-backed stack with a decompose helper that splits a stack into two by alternating elements. |
Stacks/SpecialStack.java | Min-stack: getmin() runs in O(1) using an auxiliary stack. |
Queues/PriorityQueue_Via_Stacks.java | Min-priority queue built on two Stack<Integer>s — extract-min is O(1), insert is O(n). |
Trees/AVLTree.java | Self-balancing BST with the four rotation cases (LL, LR, RR, RL) and cached node heights. |
Python/)| Path | Description |
|---|---|
Trees/Binary_Tree.py | Binary search tree with insert, deleteleaves, delete_smaller, printlevel, print_descending, and print_sideways. |
Trees/main.py | Driver that exercises the BST. |
Algorithms/utils.py | Small helpers (e.g. find_max). |
Each Java file has a main method, so you can run them directly:
cd Java/Trees
javac AVLTree.java
java AVLTree
The same pattern works for any of the other classes.
cd Python/Trees
python3 main.py
main.py adds Python/ to sys.path at runtime so it can import Algorithms.utils regardless of where you launch it from.
advanced-dsa-java-python/
├── Java/
│ ├── Heaps/
│ ├── LinkedLists/
│ ├── Queues/
│ ├── Stacks/
│ └── Trees/
└── Python/
├── Algorithms/
└── Trees/
Selected from shared topics, language and repository description—not editorial ratings.
nayuki /
Clear implementation of arithmetic coding for educational purposes in Java, Python, C++.
74/100 healthnayuki /
Clear implementation of Huffman coding for educational purposes in Java, Python, C++.
77/100 healthjpa99 /
A collection of various useful algorithms and data structures along with their Java implementations.
66/100 healthvishnugh /
A java implementation of NEAT(NeuroEvolution of Augmenting Topologies ) from scratch for the generation of evolving artificial neural networks. Only for educational purposes.
74/100 healthjimmikaelkael /
This is small example of the Multi Layer Perceptron implemented in Java. It can be used for educational purpose or experiments on this kind of neural networks. In this example the neural network will learn the XOR logical gate.
34/100 healthharshjoshi1312 /
Java DSA Library is a comprehensive collection of data structures and algorithms implemented in Java. This library is designed for both educational purposes and practical use, providing easy-to-understand code for common data structures like arrays, linked lists, stacks, queues, trees, heaps,
56/100 health