A tree is a connected acyclic graph. As a data structure, a tree has a root node, which is the common ancestor to all child nodes. In a tree, the root node is not different from any other node except for this designation, so technically any node can be the root node.