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 redirect has not been added to any content categories. Please help out by adding categories to it so that it can be listed with similar redirects. (October 2011) |