{
  "aliases": null,
  "backlinks": [
    {
      "field": "about",
      "target": "XVHKCX4F5Y"
    },
    {
      "field": "uses",
      "target": "XVHKCX4F5Y"
    }
  ],
  "body": "\n## Definition\n\nA rooted tree is a pair $(T, r)$ of a [[tree|0MJ0JS72DZ]] $T$ and a vertex $r$ of $T$, the root.\n\nLet $v \\neq r$ be a vertex, and let $u$ be the neighbour of $v$ on the unique path from $v$ to $r$.\nThen $u$ is the parent of $v$, and $v$ is a child of $u$.\nThe depth of $v$ is the [[distance|0WPZ5YPAGR]] from $r$ to $v$.\n\n## Remarks\n\nThe root has no parent, and every other vertex has exactly one parent.\nA vertex with no child is a leaf of the rooted tree. With this convention the root can be a leaf only when the tree has one vertex.\nAn ordered rooted tree also fixes an order of the children of each vertex. A [[binary tree|02A8EMC83C]] is a related recursive structure.\n\n## Explanations\n\n### L1 human\n\nA rooted tree is a tree in which one vertex is chosen as the top.\nThen each edge has a direction: from a parent toward its child, away from the root.\n",
  "commit": "ff8a40749dc16545e3d2fc637f6b0196e81d0bfa",
  "front": {
    "defines": "0Y0JGC2K9T",
    "inventory": [
      "XP9BWWD07N"
    ],
    "kind": "definition",
    "msc": [
      "05C05"
    ],
    "name": "Rooted tree",
    "sources": [
      {
        "locator": "Rooted tree",
        "url": "https://en.wikipedia.org/wiki/Tree_(graph_theory)"
      }
    ],
    "tag": "0C9J6W2A8A",
    "uses": [
      "0MJ0JS72DZ"
    ]
  },
  "kind": "definition",
  "link": "https://tamnd.github.io/math2/node/0C9J6W2A8A/",
  "links": [
    {
      "field": "defines",
      "target": "0Y0JGC2K9T"
    },
    {
      "field": "uses",
      "target": "0MJ0JS72DZ"
    }
  ],
  "markdown": "https://tamnd.github.io/math2/node/0C9J6W2A8A.md",
  "msc": [
    "05C05"
  ],
  "name": "Rooted tree",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/0C9/0C9J6W2A8A.md",
  "status": null,
  "tag": "0C9J6W2A8A",
  "uri": "m2://0C9J6W2A8A",
  "url": "https://tamnd.github.io/math2/wiki/rooted-tree-definition/",
  "writing": {
    "tag": "0C9J6W2A8A",
    "kind": "definition",
    "level": "W1",
    "next": [
      {
        "what": "edge instance_of in",
        "note": "one example",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge not_instance_of in",
        "note": "one non-example that fails one clause",
        "have": 0,
        "want": 1
      }
    ]
  }
}