Poco común · Saberes
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
In computer science, a ternary search tree is a type of trie (sometimes called a prefix tree) where nodes are arranged in a manner similar to a binary search tree, but with up to three children rather than the binary tree's limit of two. Like other prefix trees, a ternary search tree can be used as an associative map structure with the ability for incremental string search.
En Wikipedia
Texto en inglés Aún no hay artículo en tu idioma: extracto en inglés.
In computer science, a ternary search tree is a type of trie (sometimes called a prefix tree) where nodes are arranged in a manner similar to a binary search tree, but with up to three children rather than the binary tree's limit of two. Like other prefix trees, a ternary search tree can be used as an associative map structure with the ability for incremental string search. However, ternary search trees are more space efficient compared to standard prefix trees, at the cost of speed. Common applications for ternary search trees include spell-checking and auto-completion.
Texto: Wikipedia en inglés, CC BY-SA 4.0. · Imagen: Alirezanaeiji (CC BY-SA 4.0) ·
Cartas cercanas
-
★★★
Árbol-B
Estructura de datos
-
C★★
Computadora ternaria
-
★
Diagrama ternario
Diagrama baricéntrico que se emplea para representar tres variables
-
★★
Aprendizaje basado en árboles de decisión
-
★★★
Montículo (informática)
Estructura informática de datos del tipo árbol
-
★★★
Terna pitagórica
Conjunto ordenado de tres números enteros positivos a, b, c, y son solución de la ecuación diofántica cuadrática a2+b2=c2