Content deleted Content added
... and how on earth are the leaves going to have degree 3?? |
m Dating maintenance tags: {{Mergeto}} {{Dubious}} |
||
Line 1:
{{mergeto|Tree (graph theory)|date=July 2014}}
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>{{dubious|date=July 2014}}
== References ==
| |||