Red-Black Tree
A fully functional Red-Black Tree implementation in C++ that supports insertion, deletion, and search operations. Designed for efficiency and correctness, this project demonstrates my understanding of advanced data structures and balancing algorithms.
Languages
C++Tools & Libraries
GTest Git
Project Details:
-
This project implements a self-balancing Red-Black Tree with all standard operations: insertion,
deletion, and search.
Each node maintains a color and the tree satisfies all Red-Black properties to ensure
O(log n)operation time. - Comprehensive unit tests using GTest were written to ensure correctness and robustness under various insertion and deletion sequences.