Unrooted binary tree

In mathematics and computer science, an unrooted binary tree is an unrooted tree in which each vertex has either one or three neighbors.