A lightweight Java implementation of a binary search tree written from scratch—no Java collections used. Built as part of the Algorithms and Programming Models course to deepen understanding of tree ...

This Java project implements a Red-Black Tree (RBT), a self-balancing binary search tree that maintains balanced height with insertions and deletions. The implementation includes all standard RBT ...