The Ternary search tree cardTernary search tree

Ternary search tree

Common

Rarity: Common

The most frequent rarity: most Wikipedia articles become Commons.

Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.

At a glance

Class
Notion
Domain
Science and technology
In collections
Nobody has pulled it yet.

What Wikipedia says

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.

Excerpt from the Wikipedia article “Ternary search tree”, under the CC BY-SA 4.0 license. Read the article on Wikipedia

Image: Alirezanaeiji, CC BY-SA 4.0, via Wikimedia Commons.

Open free boosters and add Ternary search tree to your collection.

Play for free

Related cards