Wikipedia

Rooted binary tree

This is an old revision of this page, as edited by Mmmzeta0 (talk | contribs) at 09:00, 7 October 2011 (Creation). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Types of binary trees

  • 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]
Retrieved from "https://en.wikipedia.org/w/index.php?title=Rooted_binary_tree&oldid=454360166"