"unitree" meaning in English

{
  "forms": [
    {
      "form": "unitrees",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "unitree (plural unitrees)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Mathematics",
          "orig": "en:Mathematics",
          "parents": [
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "examples": [
        {
          "ref": "2015, Fedor Pakovich, Alexander K. Zvonkin, “Minimum Degree of the Difference of Two Polynomials over ℚ. Part II: Davenport-Zannier pairs”, in arXiv:",
          "text": "When such a tree is uniquely determined by the set of black and white degrees of its vertices, it is called unitree, and the corresponding DZ-pair is defined over #92;mathbbQ.",
          "type": "quote"
        }
      ],
      "glosses": [
        "A unique tree (for a set of vertices)"
      ],
      "id": "en-unitree-en-noun-GVdn1G4z",
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "unique",
          "unique"
        ],
        [
          "tree",
          "tree"
        ]
      ],
      "raw_glosses": [
        "(mathematics) A unique tree (for a set of vertices)"
      ],
      "topics": [
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "unitree"
}

{
  "forms": [
    {
      "form": "unitrees",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "unitree (plural unitrees)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English lemmas",
        "English nouns",
        "English terms with quotations",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Mathematics"
      ],
      "examples": [
        {
          "ref": "2015, Fedor Pakovich, Alexander K. Zvonkin, “Minimum Degree of the Difference of Two Polynomials over ℚ. Part II: Davenport-Zannier pairs”, in arXiv:",
          "text": "When such a tree is uniquely determined by the set of black and white degrees of its vertices, it is called unitree, and the corresponding DZ-pair is defined over #92;mathbbQ.",
          "type": "quote"
        }
      ],
      "glosses": [
        "A unique tree (for a set of vertices)"
      ],
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "unique",
          "unique"
        ],
        [
          "tree",
          "tree"
        ]
      ],
      "raw_glosses": [
        "(mathematics) A unique tree (for a set of vertices)"
      ],
      "topics": [
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "unitree"
}