Binary tree complexities

Question

I would like to know some complexities of binary search tree.

I can't find complete information. I want to know complexities for the following operations on a binary search tree

1. to add/insert an element
2. to remove an element
3. to find an element (as I know this one is O(log(n)) )

Answer 1

Insertion, deletion and searching in a binary search tree are:

• O(N) in the worst case;
• O(log(N)) in the average case.