{
  "aliases": [
    "recursive-trees"
  ],
  "backlinks": null,
  "body": "\n## Summary\n\nIn graph theory, a **recursive tree** (i.e., unordered tree) is a labeled, rooted [[tree|062D9KXJB1]]. A size-$n$ recursive tree's vertices are labeled by distinct positive integers $1, 2, \\ldots, n$, where the labels are strictly increasing starting at the root labeled 1. Recursive trees are [[non-planar|029JQEK15B]], which means that the children of a particular vertex are not ordered; for example, the following two size-3 recursive trees are equivalent: ${}_{3}/^{1}\\backslash_{2} =_{2}/^{1}\\backslash_{3}$.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "aliases": [
      "recursive-trees"
    ],
    "inventory": [
      "44H7SKMKSN"
    ],
    "kind": "concept",
    "name": "Recursive tree",
    "same_as": {
      "wikidata": "Q17133279",
      "wikipedia": "Recursive tree"
    },
    "sources": [
      {
        "locator": "Recursive tree",
        "mention": "wikipedia://en/5140949",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:5140949@r1285922157"
      }
    ],
    "tag": "ZBFQ8EB1RV"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/ZBFQ8EB1RV/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/ZBFQ8EB1RV.md",
  "msc": null,
  "name": "Recursive tree",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/ZBF/ZBFQ8EB1RV.md",
  "status": null,
  "tag": "ZBFQ8EB1RV",
  "uri": "m2://ZBFQ8EB1RV",
  "url": "https://math2.tamnd.com/wiki/recursive-tree/",
  "writing": {
    "tag": "ZBFQ8EB1RV",
    "kind": "concept",
    "level": "W1",
    "next": [
      {
        "what": "edge defines in",
        "note": "at least one definition",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge instance_of in",
        "note": "at least two examples",
        "have": 0,
        "want": 2
      },
      {
        "what": "edge not_instance_of in",
        "note": "at least one non-example",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge specializes both",
        "note": "the more general notions and the special cases",
        "have": 0,
        "want": 1
      }
    ]
  }
}