What Is Self Balanced Tree?

In computer science, a self-balancing binary search tree is any node-based binary search tree that automatically keeps its height small in the face of arbitrary item insertions and deletions.

What is meant by self-balancing tree?

Self-Balancing Binary Search Trees are height-balanced binary search trees that automatically keeps height as small as possible when insertion and deletion operations are performed on tree. The height is typically maintained in order of Log n so that all operations take O(Log n) time on average.

What is self balanced tree with example?

AVL Trees as an Example of Self-Balancing BSTs

Adelson-Velskii and Landis (AVL) trees are binary trees which are balanced. All the node in an AVL tree stores their own balance factor. In an AVL tree, the balance factor of every node is either -1, 0 or +1.