Binary Search Tree Insertion and Deletion17:13
Red Black Tree Introduction and RB Tree Properties00:16:04
A Red-Black Tree with n internal nodes has height at most 2log(n + 1)12:55
Red Black Tree Left Rotation Tree Right Rotation Algorithm00:15:32
Red Black Tree Insertion : RB INSERT(T,z)12:40
Red Black Tree Insertion Fixup : RB INSERT FIXUP (T z)00:16:21
Red Black Tree Insertion and Fixup Example00:20:59
Red Black Tree Deletion: RB- Delete(T,z), RB- Delete Fixup(T,x) Part-100:24:16
:Red Black Tree Deletion: RB- Delete(T,z), RB- Delete Fixup(T,x) Part-200:13:59
Red Black Tree Deletion Solved Example00:15:35
B-Tree Definition and Properties15:24
If n =1,then for any n-key B-tree T of height h minimum degree t=2,h=Log t (n+1)/200:11:09
B Tree Operations : B- Tree Search Algorithm00:11:31
Creating an empty B-tree00:11:53
B Tree insertion Solved example00:11:42
B Tree Deletion Algorithm: Delete Operation00:10:33
B Tree Deletion Solved Examples00:08:43
Binomial Heap and Binomial Tree15:24
Binomial Heap Properties and Representation00:11:53
Binomial Heap Operations: Uniting ,Create ,Finding minimum00:18:43
Binomial Heap Operations: Inserting, Extracting minimum key, Decreasing Key, Delete14:49
Binomial Heap and Binomial Tree solved Univerity Question00:18:24
Fibonacci Heap: Properties, Memory Representation13:06
Fibonacci Heap Operations Part-121:53
Fibonacci Heap Operations Part-200:14:17
Fibonacci Heap Operations Part-300:12:40
Trie Data Structure: Digitat Tree or Prefix Tree00:14:50
Skip list data structure: Operations, Skip list Search ,Insert, Delete13:21