A binary tree is a structure consisting of a set of nodes, one of which is designated as the root node, in which each remaining node is either the "left child" or "right child" of some other node, its "parent", and in which following the parent links from any node eventually leads to the root node.