Learn how to create and manipulate a binary search tree (BST) in a program using some basic steps and code examples. A BST is a data structure that supports fast searching, sorting, and insertion.

The libraries are build to run via a helping cpp program. In this project I have made libraries for Binary Search Tree, AVL trees and Red-Black trees. There is an implementation of dictionary too.