Binary Search Trees consist of nodes which are connected to each other in a tree-like way, with each branch consisting of two sub-branches, which may be null. There is one root. Finding an inserting objects are O(Log N) operations.