Skip to search formSkip to main contentSkip to account menu

2–3–4 tree

Known as: 2-3-4 trees, 2-3-4 tree, 2-4 tree 
In computer science, a 2–3–4 tree (also called a 2–4 tree) is a self-balancing data structure that is commonly used to implement dictionaries. The… 
Wikipedia (opens in a new tab)

Related topics

Related topics

9 relations
2–3 treeBinary treeComputer scienceData element

Broader (1)

B-tree

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Verified Analysis of Functional Data Structures
In recent work the author has analyzed a number of classical functional search tree and priority queue implementations with the… 
2010
2010
Experiences with active learning in CS 3
We report on our experiences with transforming CS 3 to an active-learning format. We have now had three separate instructors at… 
2008
2008
Data Structures for Storing File Namespace in Distributed File System
The distributed file system (DFS) provides a mechanism where a file can be stored across several physical computer nodes ensuring… 
2007
2007
A Visualization of 2-3-4 Trees Using Jhave
2007
2007
Experiments on the Practical I/o Eeciency of Geometric Algorithms: Distribution Sweep vs. Plane Sweep Experiments on the Practical I/o Eeciency of Geometric Algorithms: Distribution Sweep vs. Plane…
We present an extensive experimental study comparing the performance of four algorithms for the following orthogonal segment… 
2002
2002
Midterm I Practice Problems
Balanced Trees Red/black trees are an isometry of 2-3-4 trees (B-trees of order two). It's possible to encode other types of B… 
1999
1999
Constructing Optimal Search Trees in Optimal Time
(a, b)-trees are an important class of search trees. They include 2-3 trees, 2-3-4 trees, and B-trees as subclasses. We show that… 
1999
1999
A generation method of substantially seeded rights unbalancing in a tournament-type match table by the frame of balanced 2-3-4 trees structure
  • H. KodateS. Ono
  • IJCNN'99. International Joint Conference on…
  • 1999
  • Corpus ID: 10942514
A tournament-type match table has been widely employed to decide the winner of games. In the case of a balanced table… 
Review
1999
Review
1999
Sams Teach Yourself Data Structures and Algorithms in 24 Hours
Introduction. What This Book Is About. What's Different About This Book. Who This Book Is For. What You Need to Know Before You… 
1992
1992
Implementation of a family of 2-3-4 trees in the hypercube
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)