Page "Binary tree" Paragraph 1
from
Wikipedia
In computer science, a binary tree is a tree data structure in which each node has at most two child nodes, usually distinguished as " left " and " right ".
Outside the tree, there is often a reference to the " root " node ( the ancestor of all nodes ), 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.
Page 1 of 1.
2.035 seconds.