Recursive tree

In graph theory, a recursive tree (i.e., 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.

单词	Recursive tree
释义	Recursive tree 英语百科 Recursive tree In graph theory, a recursive tree (i.e., 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.
随便看	Dromiskin Dromisol dromitropic dromitropic action drom length dromler Dromling Dromo Dromod dromogram dromogran dromograph dromography Dromoi Dromoland Dromology dromomane dromomanes dromomania dromomaniac dromomerycid dromomerycids dromometer dromometre Dromon