{"version":"1.0","type":"link","title":"Unrooted binary tree - Newikis","description":"In mathematics and computer science, an unrooted binary tree is an unrooted tree in which each vertex has either one or three neighbors.","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400,"thumbnail_url":"https://thumb.wikimedia.org/wikipedia/commons/thumb/8/8a/TreeActinobacteria.svg/1280px-TreeActinobacteria.svg.png","thumbnail_width":1280,"thumbnail_height":1011}