Lecture - 14 Red Black Trees
Loading...
Loading...
41,837
Loading...
Uploaded by nptelhrd on Sep 24, 2008
Lecture Series on Data Structures and Algorithms by Dr. Naveen Garg, Department of Computer Science and Engineering ,IIT Delhi. For more details on NPTEL visit http://nptel.iitm.ac.in
- 66 likes, 2 dislikes
-
- 48:34
Lecture - 15 Insertion in Red Black Treesby nptelhrd27,505 views
- 59:20
Lecture - 14 Reasoning Using First Order Logicby nptelhrd12,267 views
- 42:36
Lecture - 16 Disk Based Data Structuresby nptelhrd18,288 views
- 53:42
Lecture - 11 AVL Treesby nptelhrd43,697 views
- 1:02:01
Lecture - 17 Case Study: Searching for Patternsby nptelhrd16,812 views
- 1:01:35
Lecture - 18 Triesby nptelhrd20,405 views
- 8:56
Realita Cinta dan Rock n Roll 9/12by sijeruk110,516,721 views
- 45:15
Mundo Modelo Temp 2 Cap 1by sebmusicz28,339,062 views
- 1:49
worst professor everby ugod355484,637 views
- 53:43
Lecture - 4 Dictionariesby nptelhrd45,575 views
- 58:58
Lecture - 34 Single Source Shortest Pathsby nptelhrd15,203 views
- 43:14
Lecture - 6 Treesby nptelhrd65,247 views
- 59:51
Lecture - 18 Satellite Communicationby nptelhrd44,440 views
- 48:27
Lecture - 22 Why Sortingby nptelhrd21,054 views
- 41:31
Lec-25 2-3 Treesby nptelhrd18,604 views
- 1:46
B-Tree exampleby rationalpsychedelia120,020 views
- 1:23:51
Lec 10 | MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503), Fall 2005by MIT21,587 views
- 1:24
Barack Obama - Computer Science Questionby weedipikia683,231 views
- 59:49
Lecture - 16 Error Controlby nptelhrd15,942 views
- 53:46
Lecture - 27 Depth First Searchby nptelhrd45,079 views
Sir I required this Lecture PPT.
valianttiger 1 day ago
Thanks Sir..
valianttiger 1 week ago
i ahve an exam soon hahah and i don't was able to follow the course this course is cool thx :)
MsDawdawdaw 2 months ago
Damn I just love the intro music. So chill.
denebgarza 3 months ago
@chaimnatan 1 possible situation (and probably the most frequent) is on the 2nd "Insertion" into a RB tree. Lets say you insert 5 as the first node into the RB tree. Now we have 1 node in our RB tree and (since it is the root) must be black. Then we insert 7 into the tree. Since 7 > 5, it must go on the right side. If we were to color this node black, the external nodes of 7 would have two black ancestors where as the external node of 5 (its left node) only has 1.Therefore the 7 node must be red
jonnism77 1 year ago 2
amazing
himanshu9408 1 year ago
What makes a node red? vs black?
chaimnatan 1 year ago
better use the term "child" rather than son.. Otherwise a female marker might get pissed off...
Rafdaganga 2 years ago
Many thanks - this helped immensely not only to implement a red-black tree, but to understand what was happening behind the deletion algorithm, and why it requires at most 3 rotations (although the particular case of 3 rotations, 2.1.1, when my red brother's right son has a red right son, isn't explicltly shown, but it's implied).
Overall, well explained and clearly shown in the slides. Thanks :)
FedericoLebron 2 years ago
U r rite .... I haven't seen da whole lecture ... Bt wat u r saying is rite
TP
IITK
arpit10001 2 years ago