Rooted binary tree
Encyclopedia
In computer science, a rooted binary tree is a tree
with a root node in which every node has at most two children. A rooted binary tree is a tree with a root which has degree 2 and all other nodes of degree 3.http://people.brandeis.edu/~igusa/Math47aF08/M47F08Note09c1.pdf
Tree (data structure)
In computer science, a tree is a widely-used data structure that emulates a hierarchical tree structure with a set of linked nodes.Mathematically, it is an ordered directed tree, more specifically an arborescence: an acyclic connected graph where each node has zero or more children nodes and at...
with a root node in which every node has at most two children. A rooted binary tree is a tree with a root which has degree 2 and all other nodes of degree 3.http://people.brandeis.edu/~igusa/Math47aF08/M47F08Note09c1.pdf