Content deleted Content added
Declining speedy deletion. It is not a good article, but the wikilinks certainly give enough context to identify its subject. |
m clean up, added uncategorised tag using AWB |
||
Line 1:
In computer science, a '''rooted binary tree''' is a [[Tree (data structure)|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]
{{Uncategorized|date=October 2011}}
| |||