Question: What is balanced binary tree?

Solution: In computer science, a self-balancing (or height-balanced) binary search tree is any node based binary search tree data structure that automatically keeps its height (number of levels below the root) small in the face of arbitrary item insertions and deletions