Support us on Patreon: [ Ссылка ]
Discord Community: [ Ссылка ]
GitHub Repository: [ Ссылка ]
If you’ve watched the previous videos of this series you may already have an idea of what you will be expecting here, because Red-Black trees just like AVL trees are self-balancing binary search trees and are actually the preferred pick among developers and frameworks. In this video, we explain in detail and implement the Red-Black trees.
Timestamps:
00:00 Introduction
00:29 What are Red-Black Trees?
05:12 Recoloring the nodes of a RBT
07:14 Rotating our nodes
08:46 Red-Black Tree Implementation
11:00 The Insert Operation
12:27 Implement the Recolor and Rotate Functionalities
18:50 The Delete Operation
19:51 Thanks for Watching!
If you found this video helpful, check other Geekific uploads:
- Generics and Wildcards in Java Made Simple: [ Ссылка ]
- Project Lombok Annotations Explained: [ Ссылка ]
- Graphs - The Fundamentals: [ Ссылка ]
- Introduction to Trees, Basic Tree Terminology and Different Types of Trees: [ Ссылка ]
- Binary Search Trees (BST) Explained and Implemented in Java: [ Ссылка ]
- AVL Trees Explained and Implemented in Java: [ Ссылка ]
#Geekific #Red-BlackTree #SelfBalancingBST #BST #Java
