What is an AVL Tree?
This lesson has a brief introduction to AVL trees, why they are used, and what makes them more efficient than regular binary search trees.
Introduction
In 1962, AVL was named after the inventors, Adelson-Velsky and Landi. They claimed that AVL trees are: “An algorithm for the organization of information." They are binary search trees such that for every internal node of the tree ...
Access this course and 1400+ top-rated courses and projects.