Technically speaking, it's defined as: all sub-nodes to a node have values <= that of the node. In rough terms it means the tree is sorted left to right (left=most node has lowest value, right-most has highest).