What is an AVL Tree?

This lesson is a brief introduction to AVL trees, why they are used, and what makes them more efficient than regular binary search trees

We'll cover the following...

Introduction

Named after inventors Adelson-Velsky and Landi, the AVL tree was invented in 1962. They claimed that AVL trees are “An algorithm for the organization of information”. They are Binary Search Trees in which for every internal node vv of the tree TT ...