January 2026

garden

What is a 23 tree?

What is a 23 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-node) and two data elements. A 2–3 tree is a B-tree of order 3. The main advantage with 2-3 trees

What is a 23 tree? Read Post »

Scroll to Top