Wikipedia

Rooted binary tree

This is an old revision of this page, as edited by Beth Holmes 1 (talk | contribs) at 12:23, 20 April 2014 (made ref into actual references section). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In computer science, a rooted binary tree is a 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.[1]

References

  1. ^ Igusa, Kiyoshi. "Binary trees" (PDF). Brandeis Math Department.


 

This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Rooted_binary_tree&oldid=605008283"