 Rooted trees, often with additional structure such as ordering of the neighbors at each vertex, are a key data structure in computer science; see tree data structure.In a context where trees are supposed to have a root, a tree without any designated root is called a "free tree".A "labeled tree" is a tree in which each vertex is given a unique label.