Revision as of 09:09, 7 October 2011 edit Albert7777 (talk \| contribs) 235 edits Requesting speedy deletion (CSD A1). (TW) ← Previous edit		Revision as of 13:33, 7 October 2011 edit undo JBW (talk \| contribs) Autopatrolled, Administrators 202,014 edits Declining speedy deletion. It is not a good article, but the wikilinks certainly give enough context to identify its subject. Next edit →
Line 1: AIn computer science, a '''rooted binary tree''' is a [[~~tree~~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]▼ ~~{{db-nocontext}}~~ ▲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]

Rooted binary tree: Difference between revisions