Red-black trees in 4 minutes — Intro

preview_player
Показать описание
An introduction to red-black trees.

Sources:

  1. Michael Sambol
  2. red-black
  3. red-black trees
  4. red black
  5. red black trees
  6. balanced search tree
Рекомендации по теме
Red-black trees in 0:03:54

Red-black trees in 4 minutes — Intro

Red-black trees in 0:05:38

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

Red-black trees in 0:05:10

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

B-trees in 4 0:03:57

B-trees in 4 minutes — Intro

Red-Black Trees - 0:13:01

Red-Black Trees - Data Structures

Red-black trees: Samuel's 0:24:20

Red-black trees: Samuel's tutorial

5.16 Red Black 0:33:00

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

Red-Black Tree Tutorial 0:12:11

Red-Black Tree Tutorial - The Advantages of Red-Black Trees

SUÇ ve CEZA 9:51:05

SUÇ ve CEZA - Fyodor Mihayloviç DOSTOYEVKİ [ORJİNAL ROMAN - TEK PARÇA]

Red Black Trees 0:17:45

Red Black Trees 2 Example of building a tree

Red-black trees in 0:03:05

Red-black trees in 3 minutes — Rotations

Red-Black Trees 0:22:05

Red-Black Trees

Red-black trees in 0:08:13

Red-black trees in 8 minutes — Deletions

Red Black Trees 0:09:54

Red Black Trees 1 - Introduction

Red Black Tree 0:01:07

Red Black Tree 16 Node Insert

Red Black Trees, 0:10:02

Red Black Trees, Video 5 Red Black Tree Insertion

Red Black Trees 0:04:22

Red Black Trees Explained

Red Black Tree 0:23:33

Red Black Tree - Self Balancing Tree - Tree Data Structure

Red Black Tree 0:13:59

Red Black Tree - Part 1

Red Black Trees, 0:07:02

Red Black Trees, Video 1 Intro, Rotation

5.17 Red Black 0:27:41

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

Red-Black Tree Rotations 0:09:09

Red-Black Tree Rotations | OCaml Programming | Chapter 8 Video 34

Red Black Tree 0:00:59

Red Black Tree Visualiser

Red Black Trees, 0:06:05

Red Black Trees, Video 8 Red Black Tree Performance and Summary

Комментарии
Автор

I still remember in past, I had to go through a long list to find his video. Now, when I searched it, it came on top! :D

arpitchristy
Автор

Studying for a Data Structures Final and your videos are really about to save me. Thanks man

DarkDay
Автор

A red-black tree is a binary tree that satisfies the following red-black properties:
1. Every node is either red or black.
2. The root is black.
3. Every leaf (NIL) is black.
4. If a node is red, then both its children are black.
5. For each node, all simple paths from the node to descendant leaves contain the
same number of black nodes.

EskyDinpuiaChhangte
Автор

dude you just nailed it simple short precise and a clear explanation no trash talking respect from india man

sj
Автор

Thank you! This was so much easier to understand then my school textbook. You speak clearly and concisely. Great visuals and loved the short video time!

ata
Автор

I am struggling for few hours ow to understand Red-black trees, and your videos are finally the ones that made it clear to me. Thanks and congrats! You won a new subscriber :)

Tourach
Автор

Note: Leafs with value Null (aka NIL) are by default Black. This means a representation of a tree with a red "Leaf" can correctly be a Red-Black Tree since its children are Null, which are Black.

ante
Автор

Great videos, very clear and understandable. Keep up the good work!

MichaJabczynski
Автор

A red-black tree is a binary search tree with one extra bit of storage per node: its
color, which can be either RED or BLACK. By constraining the node colors on any
simple path from the root to a leaf, red-black trees ensure that no such path is more
than twice as long as any other, so that the tree is approximately balanced.

EskyDinpuiaChhangte
Автор

u say root funny, but thanks for the clear and concise explanation!

ca
Автор

This is AWESOME. Love this video, hope you become more famous

juliajeehyunkim
Автор

I love the way the video is made. Perfect!!

yadhunandhanr
Автор

to be honest, I did not understand everything in this video. E.g. 1:50 . All paths from a then you add "1" and a "2" next to the five. Don't know what are you counting there, dont know what the numbers are related to?! If you count the NILs then just put the 1 to the left NIL and the 2 to the right NIL....

CaveDave
Автор

Absolutely killing it, dude. Keep going and don't stop. Easy subscribe. Thx.

ryandavis
Автор

Aren't 9, 13 and 23 leaf nodes.. Can I know why they are in red and not in black ? Please help me understand..

muralikrishnaraju
Автор

Best and simplest explanation on insertion of R-B tree on youtube. Please upload video on deletion.

NirajSingh-nvjb
Автор

I was confused that the Node 5 is black. However, when I watched the video again, It just said all red nodes have black nodes children, but not all black nodes have red children. So, the reason why Node 5 is black is to have the same black height. Right?

honglichen
Автор

I'm not sure what you mean when you say they have a guaranteed height of O(log n) -- I thought O() is used to characterize performance -- and you could just say that the guaranteed height is < log n...

firezdog
Автор

No words ... hoW to be thankful
Great tutorial🔥👍

fasihkhan
Автор

when it says that all paths from a node to its NIL descendants contain the same number of black nodes, how many black nodes does node(9) have? Does it have 1? if so doesn't node(8) have 2 black nodes to NILL?

ethanray