{
  "aliases": null,
  "backlinks": [
    {
      "field": "defines",
      "target": "0MJ0JS72DZ"
    },
    {
      "field": "specializes",
      "target": "0S4ZEZM7KE"
    },
    {
      "field": "specializes",
      "target": "0Y0JGC2K9T"
    },
    {
      "field": "uses",
      "target": "11MVWQ5R31"
    },
    {
      "field": "uses",
      "target": "70Q4YVF322"
    },
    {
      "field": "uses",
      "target": "7F5MZS55Y1"
    },
    {
      "field": "uses",
      "target": "F92JJR2NZE"
    },
    {
      "field": "uses",
      "target": "S0DAGR1WN7"
    },
    {
      "field": "uses",
      "target": "ZH3K0BH68K"
    },
    {
      "field": "about",
      "target": "ZH3K0BH68K"
    }
  ],
  "body": "\n## Summary\n\nA tree is a connected graph with no cycles. Trees are the minimal connected graphs, and they appear in data structures, in spanning problems and in counting problems. The node [[tree|0MJ0JS72DZ]] gives the precise definition.\n",
  "commit": "ff8a40749dc16545e3d2fc637f6b0196e81d0bfa",
  "front": {
    "kind": "concept",
    "msc": [
      "05C05"
    ],
    "name": "Tree",
    "same_as": {
      "wikidata": "Q272735",
      "wikipedia": "Tree (graph theory)"
    },
    "sources": [
      {
        "locator": "Tree",
        "url": "https://en.wikipedia.org/wiki/Tree_(graph_theory)"
      }
    ],
    "specializes": [
      "0GGXWDNKBR",
      "0KWFFMDF8T"
    ],
    "tag": "062D9KXJB1"
  },
  "kind": "concept",
  "link": "https://tamnd.github.io/math2/node/062D9KXJB1/",
  "links": [
    {
      "field": "specializes",
      "target": "0GGXWDNKBR"
    },
    {
      "field": "specializes",
      "target": "0KWFFMDF8T"
    }
  ],
  "markdown": "https://tamnd.github.io/math2/node/062D9KXJB1.md",
  "msc": [
    "05C05"
  ],
  "name": "Tree",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/062/062D9KXJB1.md",
  "status": null,
  "tag": "062D9KXJB1",
  "uri": "m2://062D9KXJB1",
  "url": "https://tamnd.github.io/math2/wiki/tree/",
  "writing": {
    "tag": "062D9KXJB1",
    "kind": "concept",
    "level": "W1",
    "next": [
      {
        "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
      }
    ]
  }
}