An AVL Tree is a self-balancing Binary Search Tree (BST). It was invented by Georgy Adelson-Velsky and Evgenii Landis in 1962. The name AVL comes from the first letters of their surnames. In an AVL ...

This project implements a self-balancing AVL Tree to search over 10,000 book records from the Goodreads dataset. The goal is to compare how well AVL performs over Linear Search on Large Datasets. The ...