2-3-4 Trees

Introduction

2-3-4 trees are a self-balencing tree data structure.

A 2-3-4 can be used for searching and sorting

Properties

• Each internal node has either 2, 3, or 4 children
• Every path from the root to a lead has the same length
• Nodes are kept balenced by pre-emtive splitting when necessary

Visit for more info: Geeks for Geeks on 2-3-4 trees