Dictionary Using Binary Search Tree

This project is a simple dictionary application that stores the keywords and their meaning using binary search tree (BST) in C++

This is a simple dictionary project that is created by using Binary Search Tree (BST) as it is a simple way to implement an ordered dictionary.

In this project, the words and the meaning of those keywords can be stored.

It allows the user to:

1. Add the keywords.

2. Delete the keywords.

3. Update the keywords and their meaning.

The entire data in the dictionary can be displayed in ascending or descending order.

It allows the user to display the data in inorder, preorder, postorder, level order, and tree-like structure.

Dictionary Using Binary Search Tree | C++