Revision as of 09:00, 7 October 2011 edit Mmmzeta0 (talk \| contribs) 13 edits Creation		Revision as of 09:00, 7 October 2011 edit undo Mmmzeta0 (talk \| contribs) 13 edits Creation Fix Next edit →
Line 1: * 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]▼ ~~==Types of binary trees==~~ ▲* 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