Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:14698999n
Noun Concept
Categories: B-tree
EN
2–3–4 tree  2-3-4 Trees  2-3-4 tree  2-4 tree  2 4 tree
EN
In computer science, a 2–3–4 tree is a self-balancing data structure that can be used to implement dictionaries. Wikipedia
Definitions
Relations
Sources
EN
In computer science, a 2–3–4 tree is a self-balancing data structure that can be used to implement dictionaries. Wikipedia
Self-balancing data structure Wikidata
IS A
data structure
B-tree
FOLLOWS
2–3 tree
STUDIED BY
graph theory
Wikipedia
EN
2–3–4 tree
Wikidata
EN
2–3–4 tree
Wikipedia Redirections
EN
2-3-4 Tree, 2-3-4 tree, 2-3-4 trees, 2-3-4 Trees, 2-4 tree, 2 4 tree
Wikidata Alias
EN
2-3-4 tree, 2-4 tree, 2–4 tree

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License