Computer Programming Software Terms, Glossary and Dictionary
A binary tree is a tree data structure in which each node has at most two children. Typically the child nodes are called a "left" pointer, a "right" pointer. The "root" pointer points to the topmost node in the tree. The left and right pointers recursively point to smaller "subtrees" on either side. One common use of binary trees is binary search trees; another is binary heaps.