Binary tree

Binary tree is a term in computing for a data structure linking one record to two successor records. When the successor record is greater it is called the left branch and when lesser it is called the right branch.