About: 2–3–4 tree

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: 2–3–4 tree Goto Sponge NotDistinct Permalink

An Entity of Type : dbo:Building, within Data Space : el.dbpedia.org associated with source document(s)

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: * a 2-node has one data element, and if internal has two child nodes; * a 3-node has two data elements, and if internal has three child nodes; * a 4-node has three data elements, and if internal has four child nodes; * 2-node * 3-node * 4-node

Attributes	Values
rdf:type	building
rdfs:label	2–3–4 tree (en)
rdfs:comment	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: * a 2-node has one data element, and if internal has two child nodes; * a 3-node has two data elements, and if internal has three child nodes; * a 4-node has three data elements, and if internal has four child nodes; * 2-node * 3-node * 4-node (en)
sameAs	2–3–4 tree
dbp:wikiPageUsesTemplate	dbt:CS-Trees dbt:Commons_category dbt:Math dbt:Portal dbt:Reflist dbt:Infobox_data_structure
Subject	B-tree
Link from a Wikipage to an external page	https://web.archive.org/web/20140604011257/http:/aia.cis.unimelb.edu.au/demo/index.html http://opendatastructures.org/versions/edition-0.1e/ods-java/9_1_2_4_Trees.html http://www.cs.princeton.edu/~rs/talks/LLRB/LLRB.pdf https://www.educative.io/page/5689413791121408/80001
thumbnail	wiki-commons:Special:FilePath/2-3-4-tree-4-node.svg?width=300
foaf:depiction
gold:hypernym	Structure
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/2–3–4_tree?oldid=1054486477&ns=0
Wikipage page ID	1290806 (xsd:integer)
page length (characters) of wiki page	9128 (xsd:nonNegativeInteger)
Wikipage revision ID	1054486477 (xsd:integer)
Link from a Wikipage to another Wikipage	Node (computer science) 2–3 tree Associative array B-tree Big O notation B-tree Queap Computer science Data element Data structure Tree (data structure) Isomorphism Pat Morin Red–black tree
has abstract	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: * a 2-node has one data element, and if internal has two child nodes; * a 3-node has two data elements, and if internal has three child nodes; * a 4-node has three data elements, and if internal has four child nodes; * 2-node * 3-node * 4-node 2–3–4 trees are B-trees of order 4; like B-trees in general, they can search, insert and delete in O(log n) time. One property of a 2–3–4 tree is that all external nodes are at the same depth. 2–3–4 trees are isomorphic to red–black trees, meaning that they are equivalent data structures. In other words, for every 2–3–4 tree, there exists at least one red–black tree with data elements in the same order. Moreover, insertion and deletion operations on 2–3–4 trees that cause node expansions, splits and merges are equivalent to the color-flipping and rotations in red–black trees. Introductions to red–black trees usually introduce 2–3–4 trees first, because they are conceptually simpler. 2–3–4 trees, however, can be difficult to implement in most programming languages because of the large number of special cases involved in operations on the tree. Red–black trees are simpler to implement, so tend to be used instead. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/2–3–4_tree
is Wikipage redirect of	2-3-4 Tree 2-3-4 tree 2-3-4 Trees 2-3-4 trees 2-4 tree 2 4 tree
is Link from a Wikipage to another Wikipage of	List of terms relating to algorithms and data structures (a,b)-tree 2-3-4 Tree 2-3-4 tree 2–3 tree AA tree B-tree Binary tree List of data structures 2-3-4 Trees 2-3-4 trees 2-4 tree 2 4 tree
is foaf:primaryTopic of	http://en.wikipedia.org/wiki/2–3–4_tree

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (82 GB total memory, 2 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software