A red-black self-balancing interval tree

Generic red-black tree implementation for self-balancing binary search trees

The project is a menu-driven application for student courses database where the user is able to perform operations like adding a course, searching for a courses or deleting a course, etc.

A short program that implements a Red-Black Tree in C++, offering a balanced binary search tree with operations for insertion, deletion, and traversal, ensuring optimal search times and balanced tree structure.

A self-balancing binary search tree is any node-based binary search tree that automatically keeps its height (maximal number of levels below the root) small in the face of arbitrary item insertions and deletions.

Implementing self-balancing trees with AVL Trees.

Created a Phone Directory using AVL tree (self-balancing tree) in C++ using File Handling to store the Phone Numbers.

A C++ project implementing a self-balancing AVL tree for efficient word frequency counting. This program analyzes text files, finds unique words, tracks word occurrences, and prints results in alphabetical order for ease of viewing.

B+ self-balancing tree implementation using C++

Project to show performance comparison of AVL tree against SkipList in different cases