2-3-4 Trees

Explore the structure and properties of 2-3-4 trees, an advanced search tree that can hold up to three keys per node and four children. Understand its relation to 2-3 trees, including its key ordering rules and node capacity, to enhance your grasp of tree-based data structures in Python.

We'll cover the following...

- Introduction
- Example

Introduction

2-3-4 is a search tree which is an advanced version of 2-3 Trees. This tree can accommodate more keys and hence more child nodes as compared to 2-3 Trees. 2-3-4 satisfies all the properties covered in 2-3 Trees along with some additional key features:

Each internal node can contain at max three keys
Each internal node can have at max four child nodes
In case of three keys at an internal node namely left, mid, and right key, all the keys present at LeftChild node are smaller than the left key, which can be mathematically expressed as:

LeftChild.keys < LeftKey

1.Introduction to Complexity Measures

2.Introduction to Lists

3.Introduction to Linked Lists

4.Introduction to Stacks and Queues

5.Introduction to Graphs

6.Introduction to Trees

7.Trie

8.Introduction to Heap

9.Introduction to Hashing

10.Summary of Data Structures

Mock Interview

2-3-4 Trees

Introduction