{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Summary\n\nA $k$-ary tree is a rooted tree in which every internal vertex has no more than $k$ children. A 1-ary tree is just a path. A 2-ary tree is also called a [[binary tree|02A8EMC83C]], although that term more properly refers to 2-ary trees in which the children of each node are distinguished as being left or right children (with at most one of each type). A $k$-ary tree is said to be complete if every internal vertex has exactly $k$ children.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "inventory": [
      "VNVNYJX3QC"
    ],
    "kind": "concept",
    "name": "k-ary",
    "sources": [
      {
        "locator": "Glossary of graph theory, section A",
        "mention": "wikipedia://en/325802#4H89",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:325802@r1373839425"
      }
    ],
    "tag": "GNTE1J147Z"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/GNTE1J147Z/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/GNTE1J147Z.md",
  "msc": null,
  "name": "k-ary",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/GNT/GNTE1J147Z.md",
  "status": null,
  "tag": "GNTE1J147Z",
  "uri": "m2://GNTE1J147Z",
  "url": "https://math2.tamnd.com/wiki/k-ary/",
  "writing": {
    "tag": "GNTE1J147Z",
    "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
      }
    ]
  }
}