Talk:Rooted binary tree

Computing Low‑importance

	This redirect is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.ComputingWikipedia:WikiProject ComputingTemplate:WikiProject ComputingComputing articles
Low	This redirect has been rated as Low-importance on the project's importance scale.

dubious def

Latest comment: 10 years ago1 comment1 person in discussion

This is actually in the source: "A rooted binary tree is a tree with a root which has degree 2 and all other nodes of degree 3." Presumably it doesn't consider leaves to be "nodes" or else this is describing an infinite tree. JMP EAX (talk) 19:14, 25 July 2014 (UTC)Reply

Add topic