{
  "aliases": null,
  "backlinks": [
    {
      "field": "defines",
      "target": "02A8EMC83C"
    }
  ],
  "body": "\n## Summary\n\nA binary tree is a recursive structure. It is empty, or it is a root with an ordered pair of binary trees as left and right subtrees. Binary trees are a basic data structure, and they are counted by the Catalan numbers. The node [[binary tree|02A8EMC83C]] gives the precise definition.\n",
  "commit": "6ac761d40018146541484a9e8b9eafd6ecc303dc",
  "front": {
    "kind": "concept",
    "msc": [
      "05C05"
    ],
    "name": "Binary tree",
    "same_as": {
      "wikidata": "Q380172",
      "wikipedia": "Binary tree"
    },
    "sources": [
      {
        "locator": "Recursive definition",
        "url": "https://en.wikipedia.org/wiki/Binary_tree"
      }
    ],
    "tag": "0D7EZ10V2R"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/0D7EZ10V2R/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/0D7EZ10V2R.md",
  "msc": [
    "05C05"
  ],
  "name": "Binary tree",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/0D7/0D7EZ10V2R.md",
  "status": null,
  "tag": "0D7EZ10V2R",
  "uri": "m2://0D7EZ10V2R",
  "url": "https://math2.tamnd.com/wiki/binary-tree/",
  "writing": {
    "tag": "0D7EZ10V2R",
    "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
      },
      {
        "what": "edge specializes both",
        "note": "the more general notions and the special cases",
        "have": 0,
        "want": 1
      }
    ]
  }
}