This Java CLI program implements the Red-Black Binary Search Tree to traverse an English (US) dictionary, allowing multiple options such as:

• Insertion
• Search
• Print Dictionary Size
• Print Tree Height

The aim of this project is to balance binary search trees using RB Trees to guarantee a lookup complexity of O(lg(n)), instead of O(n) for a skewed tree.

This project was developed as part of the course Data Structures II in the Spring 2021 semester at the Faculty of Engineering, Alexandria University, under the Computer and Communications Engineering department, supervised by Dr. Amr El Masry.

This project was developed in the following environment:

• IntelliJ IDEA Community Edition 2023.3.4
• JDK 11

1- Clone the repository to your local machine:

git clone https://github.com/MohEsmail143/red-black-tree-dictionary-traversal.git

2- Run the project by clicking on Run 'Main.main()'. The following results should begin to appear:

This project is licensed under the MIT License - see the LICENSE.md file for details