AVL Tree and Its Implementation in C++
A height-balanced binary search tree is an AVL tree. That is, an AVL tree is a balanced binary search tree. A binary tree is considered to be balanced if the difference between the heights of its left and right subtrees is -1, 0, or +1. To put it another way, a binary tree is said to be balanced if the heights of its left and right offspring differ by -1, 0, or +1. Every node in an AVL tree stores additional data known as the balancing factor.
All the details discuss with code in the video below:
Recommended:
- Binary Tree and Tree Traversal in C++
- Insertion Sort and Merge Sort in C++
- Bubble Sort and Selection sort Implementation in C++
- Recursion and Backtracking in C++
