Revision as of 10:06, 8 October 2011 edit Racklever (talk \| contribs) Extended confirmed users, Pending changes reviewers 155,146 edits m clean up, added uncategorised tag using AWB ← Previous edit		Revision as of 00:22, 9 October 2011 edit undo LadyofShalott (talk \| contribs) Autopatrolled, Administrators 57,180 edits added Category:Trees (structure); removed {{uncategorized}} using HotCat 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.[http://people.brandeis.edu/~igusa/Math47aF08/M47F08Note09c1.pdf] ~~{{Uncategorized\|date=October 2011}}~~ [[Category:Trees (structure)]]

Rooted binary tree: Difference between revisions