Binary Search Trees consist nodes balanced by their node's value. It contains a root with left and right nodes, the right node is always has a greater value and the left node a smaller value.
Simple implementation Source
Check if Binary Tree is balanced Link