The 2–3–4 tree card2–3–4 tree

2–3–4 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 2–3–4 tree (also called a 2–4 tree) is a self-balancing data structure that can be used to implement dictionaries. The numbers mean a tree where every node with children (internal node) has either two, three, or four child nodes:

Excerpt from the Wikipedia article “2–3–4 tree”, under the CC BY-SA 4.0 license. Read the article on Wikipedia

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

Open free boosters and add 2–3–4 tree to your collection.

Play for free

Related cards