Search, insert and delete follow one path from the root, so they cost O(height). Without balancing, the height can grow to n. See AVL tree.
Binary search tree
A tree where every node's left subtree holds smaller keys and its right subtree larger ones.