Definition of binary tree in US English:

binary tree


  • A data structure in which a record is linked to two successor records, usually referred to as the left branch when greater and the right when less than the previous record.

    • ‘One of the most popular data structures is a binary tree because it links parent and child together: all data is related.’