This is an old revision of this page, as edited by JBW(talk | contribs) at 13:33, 7 October 2011(Declining speedy deletion. It is not a good article, but the wikilinks certainly give enough context to identify its subject.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.Revision as of 13:33, 7 October 2011 by JBW(talk | contribs)(Declining speedy deletion. It is not a good article, but the wikilinks certainly give enough context to identify its subject.)
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]
