Revision as of 16:28, 5 June 2016 edit Fmadd (talk \| contribs) Extended confirmed users 10,468 edits No edit summary ← Previous edit		Revision as of 00:25, 17 February 2017 edit undo Primefac (talk \| contribs) Edit filter managers, Autopatrolled, Bureaucrats, Checkusers, Oversighters, Administrators 213,255 edits m Reverted edits by Fmadd (talk) to last version by Arthur Rubin Next edit →
Line 1: [[File:TreeActinobacteria.svg\|thumb\|360px\|A [[cladogram]] in the form of an unrooted binary tree, representing the similarities and evolutionary history among species of [[actinobacteria]].]] In mathematics and computer science, an '''unrooted binary tree''' is an [[free tree\|unrooted tree]] in which each [[vertex (graph theory)\|vertex]] has either one or three ~~neighbours~~neighbors. ==Definitions==

Unrooted binary tree: Difference between revisions