BINARY TREE

(n.) A type of tree structure in which one or two subtrees branch from a single node . Each node contains a keyword; the subtrees contain one value less and one value more than the key value.