Binary Tree - Why do we go for binary search tree instead of binary tree?

Binary search trees are chosen over binary trees due to their efficient search, insertion, and deletion of data elements. The structure of a BST allows each comparison to bypass about half of the remaining tree, hence, the performance of the search is equivalent to the binary logarithm.