| has gloss | eng: In computer science, a binary tree is a tree data structure in which each node has storage for at most two references to child nodes. Usually the two references are distinguished as the "left" and "right" child. A node may contain a "parent" reference, which refers to the node that has it as a child. Outside the tree, there is a reference to the "root" node if it exists. Any node in the data structure can be reached by starting at root node and repeatedly following references to either the left or right child. |
