ternary search tree (Q2859802)

From Wikidata
Jump to: navigation, search
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
  • TST
edit
Language Label Description Also known as
English
ternary search tree
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
  • TST

Statements

Identifiers

 
edit
    edit
      edit
        edit
          edit
            edit
              edit
                edit