Logo
Unionpedia
Communication
Get it on Google Play
New! Download Unionpedia on your Androidâ„¢ device!
Install
Faster access than browser!
 

2–3–4 tree

Index 2–3–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. [1]

13 relations: Associative array, B-tree, Big O notation, Computer science, Data element, Data structure, Isometry, John Wiley & Sons, Node (computer science), Red–black tree, The Art of Computer Programming, Tree (data structure), 2–3 tree.

Associative array

In computer science, an associative array, map, symbol table, or dictionary is an abstract data type composed of a collection of (key, value) pairs, such that each possible key appears at most once in the collection.

New!!: 2–3–4 tree and Associative array · See more »

B-tree

In computer science, a B-tree is a self-balancing tree data structure that keeps data sorted and allows searches, sequential access, insertions, and deletions in logarithmic time.

New!!: 2–3–4 tree and B-tree · See more »

Big O notation

Big O notation is a mathematical notation that describes the limiting behaviour of a function when the argument tends towards a particular value or infinity.

New!!: 2–3–4 tree and Big O notation · See more »

Computer science

Computer science deals with the theoretical foundations of information and computation, together with practical techniques for the implementation and application of these foundations.

New!!: 2–3–4 tree and Computer science · See more »

Data element

In metadata, the term data element is an atomic unit of data that has precise meaning or precise semantics.

New!!: 2–3–4 tree and Data element · See more »

Data structure

In computer science, a data structure is a data organization and storage format that enables efficient access and modification.

New!!: 2–3–4 tree and Data structure · See more »

Isometry

In mathematics, an isometry (or congruence, or congruent transformation) is a distance-preserving transformation between metric spaces, usually assumed to be bijective.

New!!: 2–3–4 tree and Isometry · See more »

John Wiley & Sons

John Wiley & Sons, Inc., also referred to as Wiley, is a global publishing company that specializes in academic publishing.

New!!: 2–3–4 tree and John Wiley & Sons · See more »

Node (computer science)

A node is a basic unit used in computer science.

New!!: 2–3–4 tree and Node (computer science) · See more »

Red–black tree

A red–black tree is a kind of self-balancing binary search tree in computer science.

New!!: 2–3–4 tree and Red–black tree · See more »

The Art of Computer Programming

The Art of Computer Programming (sometimes known by its initials TAOCP) is a comprehensive monograph written by Donald Knuth that covers many kinds of programming algorithms and their analysis.

New!!: 2–3–4 tree and The Art of Computer Programming · See more »

Tree (data structure)

In computer science, a tree is a widely used abstract data type (ADT)—or data structure implementing this ADT—that simulates a hierarchical tree structure, with a root value and subtrees of children with a parent node, represented as a set of linked nodes.

New!!: 2–3–4 tree and Tree (data structure) · See more »

2–3 tree

In computer science, a 2–3 tree is a tree data structure, where every node with children (internal node) has either two children (2-node) and one data element or three children (3-nodes) and two data elements.

New!!: 2–3–4 tree and 2–3 tree · See more »

Redirects here:

2 4 tree, 2-3-4 Tree, 2-3-4 Trees, 2-3-4 tree, 2-3-4 trees, 2-4 tree.

References

[1] https://en.wikipedia.org/wiki/2–3–4_tree

OutgoingIncoming
Hey! We are on Facebook now! »