Binary search and binary search tree (BST) are two different concepts, though they sound similar. Binary search is an algorithm used to find an element in a sorted array or list. It works by repeatedly dividing the search range in half — comparing the middle element with the target, and then deciding whether to search in the left or right half.

On the other hand, a binary search tree is a data structure, specifically a type of binary tree where each node has at most two children. The left child of a node contains values smaller than the node, and the right child contains values greater.

While both use the "binary" idea of halving or branching into two parts, binary search is an algorithm, and a binary search tree is a structure that stores data in a way that supports binary-search-like operations. Binary search applies to sorted linear structures like arrays, whereas a BST organizes data hierarchically using nodes. So, they are related by concept but are not the same.