Data Structures for Coding Interviews in C#/

...

2-3-4 Trees

A brief introduction to 2-3-4 Trees. This will discuss its key features and take a look at its examples.

We'll cover the following...

- Introduction
- Example

Introduction

2-3-4 is a search tree that is an advanced version of 2-3 trees. This tree can accommodate more keys; hence, there are 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 three keys at max.
Each internal node can have four child nodes at max.
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.

Introduction to Complexity Measures

Introduction to Arrays

Introduction to Linked Lists

Introduction to Stack/Queues

Introduction to Graphs

Introduction to Trees

Trie

Introduction to Heap

Introduction to Hashing

Summary of Data Structures

2-3-4 Trees

Introduction