Experiment with concepts of AVL tree, or the self-balancing binary search tree in specific. In this project, we can see how: Create the private Node class that include the field for value, two Node ...

This AVL tree is used to store and retrieve data from a knowledge base, with each node containing a term, a statement, and a confidence score. Main application class to run the AVL tree operations.