2-3 TREE

Let we understand 2-3 tree by some points:

📢 It is a basically a B Tree of order 3.

📢 It has maximum 2 children and maximum 2 key values.

📢 It is a search tree.

📢 To keep the height of a binary search tree a 2-3 tree were developed.

📢 A 2-3 tree is a binary search tree that can have the following nodes

    1. Leaf Nodes

    2. 2- Nodes

    3. 3-Nodes