2 votes 2 votes The $2-3-4$ tree is a self-balancing data structure, which is also called : $2-4$ tree $B+$ tree $B-$ tree None of the options Databases nielit2017dec-assistanta databases b-tree + – admin asked Mar 31, 2020 recategorized Aug 24, 2020 by Lakshman Bhaiya admin 1.5k views answer comment Share Follow See 1 comment See all 1 1 comment reply Hradesh patel commented Mar 31, 2020 reply Follow Share 2-3-4 tree is B tree and it is commonly in used for data dictionary. 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes Option A 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 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 for more details https://en.wikipedia.org/wiki/2%E2%80%933%E2%80%934_tree Mohit Kumar 6 answered May 25, 2020 Mohit Kumar 6 comment Share Follow See all 0 reply Please log in or register to add a comment.