What is a binary search tree? How are elements inserted, deleted and other operations

(e.g. find,

findMin, findMax)

that can be performed on binary search trees?

What is

the best, worst, and average case

of time complexity for each operation? (e.g., insert,

delete, find, traversal, etc.)