n 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.[citation needed] 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; - Study24x7
Social learning Network
study24x7

Default error msg

Login

New to Study24x7 ? Join Now
Already have an account? Login
26 Mar 2019 10:09 AM study24x7 study24x7

n 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.[citation needed] The numbers mean a tree where every node with children (inte...

See more

study24x7
Write a comment
Related Questions
500+   more Questions to answer
Most Related Articles