Rooted binary tree: Difference between revisions

Content deleted Content added

Revision as of 12:23, 20 April 2014 edit Beth Holmes 1 (talk \| contribs) Extended confirmed users 536 edits made ref into actual references section ← Previous edit		Latest revision as of 00:25, 17 February 2017 edit undo Primefac (talk \| contribs) Edit filter managers, Autopatrolled, Bureaucrats, Checkusers, Oversighters, Administrators 213,253 edits m Reverted edits by Fmadd (talk) to last version by David Eppstein
(7 intermediate revisions by 4 users not shown)
Line 1: #REDIRECT [[Binary tree]] 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}}~~ ~~[[Category:Trees (data structures)]]~~ ~~{{algorithm-stub}}~~