Red-Black Trees

Показать описание

An introduction to Red-Black trees. I discuss insertion but not deletion.

0:00 Introduction
0:36 Red-black tree: definition
2:40 black-height
4:51 The height of a red-black tree (proof)
8:18 Insertion: Overview
10:50 Rotations
13:02 Fixing the red-black property
17:58 Insertion: Example
20:56 Wrap-Up

Algorithms Lab

Рекомендации по теме

Комментарии

This is the only tutorial that explained when to do recoloring or rotation in a clear and simple way.
I wish I could give 10x likes.
Thank You!

asarephilip

Many thanks for all the very informative videos. Your explanations are great, and have helped me learn a great deal. Thanks for your hard work!

AdamKuczynski

Very concise and clear, thank you very much Professor!

rean

Nice and enlightening video, thanks! If I'd dare some criticism, It could be more clear the reason for the rotation in case2. It seems almost like the criterium is whether it's the right or left child of the parent, but that depends again on which child the parent is of the grandparent. Anyway, it's the most informative video I found on the topic, so good job!

mrleenudler

Excellent explanation. And thank you for assuming knowledge of BSTs and such.

kabooby

Even though I dont understand some of the terms you use (its me on since Im not that good in DSA) but as a whole I like the way you explain things. Im currently studying DSA.

j-p-d-e-v

I wonder whether a all-black linear list could be seen as RBT.I understand that the corresponding operations guarantee that such trees can not be built.But, it's the definition that comes first. According to my search, as long as a BST that satisfies those 5 requirements should be called RBT. Like 1->2->3->4->NULL with all black color, the case at least to me does not violate any of those properties or I just missed something.

kevinxiong

But the resulting tree is not balanced, or is there something I might have missed?

mpho_moses

But wait, how did you fix the RB properties at 17:56, if #5 is violated? "For each node, all paths from the node to descendant leaves contain the same number of black nodes".

dmytrodieiev

Could you put this video on Odysee, please? It is excellent! Thanks you!

tsunamio

Red-Black Trees

Red-black trees in 4 minutes — Intro

Red-Black Trees

Red-Black Trees - Data Structures

5.16 Red Black tree | Introduction to Red Black trees | DSA Tutorials

Red-black trees: Samuel's tutorial

Red-black trees in 5 minutes — Insertions (strategy)

Red Black Tree 1 The Rules

5.17 Red Black Tree Insertion | Insertion Algorithm | Data Structure Tutorials

Mystery:The arrival of the new Black Emperor Part 10 AUDIOBOOK|FANTASY|ADVENTURE|MAGIC|LIGHT NOVEL

Red-black trees in 5 minutes — Insertions (examples)

Advanced Data Structures: Red-Black Trees

Red-black trees in 3 minutes — Rotations

Red-Black Trees Explained and Implemented in Java | Tree Rotations | Self-Balancing Trees | Geekific

Red-black trees in 8 minutes — Deletions

Lec-62: Introduction to Red-Black Tree | Data Structure for Beginners

5.18 Red Black Tree Deletion | DSA Tutorials for Beginners

Simplest way understand Insertion of Data In Red Black Tree

Red Black Tree Insertion

Red Black Trees 2 Example of building a tree

Red-Black Tree Insertion

Insertion for Red-Black Trees ( incl. Examples ) - Data Structures

Red Black Trees in JAVA | Explained, Examples and Coded

Red Black Tree - Data-structure 2 (25)

Trees Compared and Visualized | BST vs AVL vs Red-Black vs Splay vs Heap | Geekific