Revision as of 07:42, 20 January 2013 edit Rpyle731 (talk \| contribs) Extended confirmed users, Pending changes reviewers 38,690 edits m stub sort ← Previous edit		Revision as of 12:23, 20 April 2014 edit undo Beth Holmes 1 (talk \| contribs) Extended confirmed users 536 edits made ref into actual references section Next edit →
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.[<ref>{{cite web\|last=Igusa\|first=Kiyoshi\|title=Binary trees\|url=http://people.brandeis.edu/~igusa/Math47aF08/M47F08Note09c1.pdf]\|publisher=Brandeis Math Department}}</ref> == References == {{Reflist}}

Rooted binary tree: Difference between revisions