"Patricia tree" meaning in English

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "Patricia"
      },
      "expansion": "Patricia",
      "name": "m"
    }
  ],
  "etymology_text": "Coined by Donald R. Morrison in 1968, as an acronym of practical algorithm to retrieve information coded in alphanumeric, designed to spell out the name Patricia.",
  "forms": [
    {
      "form": "Patricia trees",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "Patricia tree (plural Patricia trees)",
      "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": "English entries with language name categories using raw markup",
          "parents": [
            "Entries with language name categories using raw markup",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English terms with non-redundant non-automated sortkeys",
          "parents": [
            "Terms with non-redundant non-automated sortkeys",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Theory of computing",
          "orig": "en:Theory of computing",
          "parents": [
            "Computer science",
            "Computing",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "A radix tree with radix of 2, meaning that each bit of the key is compared individually and each node is a two-way branch."
      ],
      "id": "en-Patricia_tree-en-noun-DNkVG6s5",
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "radix tree",
          "radix tree"
        ],
        [
          "bit",
          "bit"
        ],
        [
          "key",
          "key"
        ],
        [
          "node",
          "node"
        ],
        [
          "branch",
          "branch"
        ]
      ],
      "raw_glosses": [
        "(computing theory) A radix tree with radix of 2, meaning that each bit of the key is compared individually and each node is a two-way branch."
      ],
      "synonyms": [
        {
          "word": "Patricia trie"
        }
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "word": "Patricia tree"
}

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "Patricia"
      },
      "expansion": "Patricia",
      "name": "m"
    }
  ],
  "etymology_text": "Coined by Donald R. Morrison in 1968, as an acronym of practical algorithm to retrieve information coded in alphanumeric, designed to spell out the name Patricia.",
  "forms": [
    {
      "form": "Patricia trees",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "Patricia tree (plural Patricia trees)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English entries with language name categories using raw markup",
        "English eponyms",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "English terms with non-redundant non-automated sortkeys",
        "en:Theory of computing"
      ],
      "glosses": [
        "A radix tree with radix of 2, meaning that each bit of the key is compared individually and each node is a two-way branch."
      ],
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "radix tree",
          "radix tree"
        ],
        [
          "bit",
          "bit"
        ],
        [
          "key",
          "key"
        ],
        [
          "node",
          "node"
        ],
        [
          "branch",
          "branch"
        ]
      ],
      "raw_glosses": [
        "(computing theory) A radix tree with radix of 2, meaning that each bit of the key is compared individually and each node is a two-way branch."
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "synonyms": [
    {
      "word": "Patricia trie"
    }
  ],
  "word": "Patricia tree"
}