Binary Tree

In computer science, a binary tree is a tree data structure in which each node has at most two children, which are referred to as the left child and the right child.

AVL Balancing

AVL tree is a self-balancing Binary Search Tree (BST) where the difference between heights of left and right subtrees cannot be more than one for all nodes.

---

This is a web app visualizes how AVL balancing is performed on Binary Tree

Steps

• Run the app
• Press right buttom of the mouse
• Enter the integer numbers
• You will get binary tree on left side and AVL balanced tree on the right side