e/Recursive tree

Information
has gloss	eng: In graph theory, a discipline within mathematics, a recursive tree (ie, unordered tree) is a non-planar labeled rooted tree. A size-n recursive tree is labeled by distinct integers 1, 2, ..., n, where the labels are strictly increasing starting at the root labeled 1. Recursive trees are non-planar, which means that the children of a particular node are not ordered. E.g. the following two size-three recursive trees are the same.
lexicalization	eng: recursive tree
instance of	c/Trees (graph theory)