A binary tree is a tree data structure in which each node has at most two children, which are referred to as the and the. A recursive definition using just set theory notions is that a binary tree is a triple, where L and R are binary trees or the empty set and S is a singleton set. Some authors allow the binary tree to be the empty set as well.