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.[1]
 | This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it. |