Ternary search tree

    flowchart
    AA["Associated Authors (0)"]
    C[Ternary search tree]
    BC["Broader Concepts (1)"]
    NC["Narrower Concepts (0)"]
    C== skos:broader ==>BC
    NC== skos:broader ==>C
    AA== dcterms:relation ==>C
    click BC "#broader-concepts"
    click NC "#narrower-concepts"
    click AA "#associated-authors"

    NI["add incoming edge"]
    NO["add outgoing edge"]
    NI-- ? -->C
    C-- ? -->NO
    click NI "#add-incoming-edge"
    click NO "#add-outgoing-edge"
    style NI stroke-width:2px,stroke-dasharray: 5 5
    style NO stroke-width:2px,stroke-dasharray: 5 5

Graph neighborhood for 'Ternary search tree'. Click aggregate nodes to navigate.

Wikidata: https://www.wikidata.org/wiki/Q2859802
OpenAlex ID: https://openalex.org/C136519935 (API record)
OpenAlex Description: 3-way tree data structure where every node's left subtree has keys less than the node's key, every middle subtree has keys equal to the node's key, and every right subtree has keys greater than the node's key
OpenAlex Level [?]: 5

Ternary search tree

Broader Concepts

Narrower Concepts

Associated Authors

Add Incoming Edge

Add Outgoing Edge