Problem 1 - Binary search and balanced trees

1.

Describe the fundamental operations on a binary search tree.

2.

Pick up an efficiently maintainable condition for binary search trees to be balanced, and show that trees satisfying that condition are balanced.

See [SED00] for a detailed answer.