What are the Examples of Binary Search? Let's take a look at one ... Binary Search Trees (BSTs): A BST is a tree-like data structure in which each node can have a maximum of two children.