The difference in height between left and right subtrees of any node is at most 1.

This is a type of binary search tree.

The height is log(N).

The height is proportional to the number of nodes in the tree.

Has constant-time insertion and deletion operations.

The difference in height between left and right subtrees of any node is at most 0.

Maintains balance by performing rotations.