Balanced Trees & Introduction to Self Balancing Trees | Trees | Data Structures Simplified - TheBinaryRealm
A balanced binary tree or a height-balanced tree is a tree in which the height of the left and right subtree at any node does not differ by more than one. Not just the root node, at any node. Mathematically we define using a balanced factor.