Data Structures for Coding Interviews in JavaScript/

...

2-3-4 Trees

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

We'll cover the following...

Introduction
Example

Introduction

2-3-4 is an advanced version of 2-3 Trees. This tree can accommodate more keys and 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

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