what is a binary search tree?

A binary tree is a binary tree representation (a maximum of 2 childern per node) in which the left node has a value smaller than the parent node and the right node has a value greater than the parent. Because of this, the complexity of searches, insertions, and deletions are O(log n) in the worste case scenario.