PDC4S:\IT\DSA and Interview Preperation\[INTERVIEW ONLY MAAL] [EXCLUSIVE]\[RBR] INTERVIEW PREPRATION 2021\15.Advanced Data Structures

Up one directory...
NameSizeDate Modified
1.Design LRU cache replacement algorithm (Approach - 1).mp4132,844 KB12/12/2021 12:34 PM
10.Insertion in Red Black trees.mp448,943 KB12/12/2021 12:34 PM
11.Insertion in Red Black trees (Case - 1).mp452,576 KB12/12/2021 12:34 PM
12.Insertion in Red Black trees (Case - 2).mp485,664 KB12/12/2021 12:34 PM
13.Insertion in Red Black trees (Case - 3).mp4142,471 KB12/12/2021 12:34 PM
14.Insertion in Red Black trees (Case - 4).mp4185,691 KB12/12/2021 12:34 PM
15.Insertion in Red Black trees (Case - 5).mp494,010 KB12/12/2021 12:34 PM
16.Insertion in Red Black trees (Case - 6).mp4131,745 KB12/12/2021 12:34 PM
17.Insertion Example in Red Black Trees.mp4188,849 KB12/12/2021 12:34 PM
18.Deletion in Red Black Trees.mp446,385 KB12/12/2021 12:34 PM
19.Deletion in Red Black Trees (Case - 1).mp49,600 KB12/12/2021 12:34 PM
2.Design LRU cache replacement algorithm (Approach - 2).mp4109,859 KB12/12/2021 12:34 PM
20.Double blackness during deletion.mp472,757 KB12/12/2021 12:34 PM
21.Deletion in Red Black Trees (Case - 2).mp434,631 KB12/12/2021 12:34 PM
22.Deletion in Red Black Trees (Case - 3).mp4203,874 KB12/12/2021 12:34 PM
23.Deletion in Red Black Trees (Case - 4).mp4171,107 KB12/12/2021 12:34 PM
25.Deletion in Red Black Trees (Case - 6).mp4155,370 KB12/12/2021 12:34 PM
26.Deletion Example in Red Black Trees.mp4334,987 KB12/12/2021 12:34 PM
27.Maximum height of a Red Black Tree.mp4103,665 KB12/12/2021 12:34 PM
28.Comparison between AVL Tree and Red Black Tree.mp447,605 KB12/12/2021 12:34 PM
29.Introduction to B-Trees.mp453,550 KB12/12/2021 12:34 PM
3.Design LRU cache replacement algorithm (Approach - 3).mp476,351 KB12/12/2021 12:34 PM
30.Structure of B-Tree.mp4193,368 KB12/12/2021 12:34 PM
31.Searching in B-Tree.mp489,808 KB12/12/2021 12:34 PM
32.Insertion in B-Tree.mp4178,429 KB12/12/2021 12:34 PM
33.Deletion in B-Tree.mp4209,809 KB12/12/2021 12:34 PM
34.Deletion in B-Trees Example.mp4179,318 KB12/12/2021 12:34 PM
35.Introduction to B+ Trees.mp4134,325 KB12/12/2021 12:34 PM
36.Structure of leaf nodes in a B+Trees.mp499,890 KB12/12/2021 12:34 PM
37.Searching in B+Trees.mp439,886 KB12/12/2021 12:34 PM
38.Insertion in B+ Trees.mp4158,365 KB12/12/2021 12:34 PM
39.Deletion in B+Trees.mp497,200 KB12/12/2021 12:34 PM
4.Introduction to AVL trees and balancing.mp4355,228 KB12/12/2021 12:34 PM
40.Introduction to Splay Trees.mp459,803 KB12/12/2021 12:34 PM
41.Searching in Splay Trees.mp429,009 KB12/12/2021 12:34 PM
42.Tree Rotations.mp489,579 KB12/12/2021 12:34 PM
43.Example on searching in Splay Trees.mp4120,186 KB12/12/2021 12:34 PM
44.Insertion in Splay Trees.mp4109,079 KB12/12/2021 12:34 PM
45.Deletion in splay trees.mp4101,249 KB12/12/2021 12:34 PM
46.Introduction to Binomial Heaps.mp4102,628 KB12/12/2021 12:34 PM
47.Properties of Binomial Trees.mp448,305 KB12/12/2021 12:34 PM
48.Properties of Binomial Heaps.mp449,494 KB12/12/2021 12:34 PM
49.Structure of Binomial Heaps.mp4112,822 KB12/12/2021 12:34 PM
5.Constructing AVL trees and time complexity analysis.mp4327,228 KB12/12/2021 12:34 PM
50.Find the minimum key in a Binomial Min Heap.mp434,284 KB12/12/2021 12:34 PM
51.Union of two Binomial Min Heaps.mp4210,940 KB12/12/2021 12:34 PM
52.Example on union of two Binomial Min Heaps.mp462,584 KB12/12/2021 12:34 PM
53.Insert a node into Binomial Min Heap.mp4135,125 KB12/12/2021 12:34 PM
54.Extract minimum from a Binomial Min Heap.mp462,818 KB12/12/2021 12:34 PM
55.Example on Extracting minimum from a Binomial Min Heap.mp453,381 KB12/12/2021 12:34 PM
56.Decreasing a key in Binomial Min Heap.mp477,084 KB12/12/2021 12:34 PM
57.Deleting a node from Binomial Min Heap.mp445,347 KB12/12/2021 12:34 PM
58.Deleting a node from Binomial Min Heap.mp4107,168 KB12/12/2021 12:34 PM
59.Introduction to Skip List.mp4107,168 KB12/12/2021 12:34 PM
59.Searching in Skip List.mp4105,212 KB12/12/2021 12:34 PM
6.Construction of AVL tree.mp4437,816 KB12/12/2021 12:34 PM
61.Insertion in Skip List.mp4191,582 KB12/12/2021 12:34 PM
62.Deletion in Skip List.mp445,122 KB12/12/2021 12:34 PM
63.Introduction to Trie.mp435,966 KB12/12/2021 12:34 PM
64.Building a Trie.mp486,365 KB12/12/2021 12:34 PM
65.Implementation, insertion and searching in a Trie.mp496,426 KB12/12/2021 12:34 PM
66.Deletion in Trie.mp484,019 KB12/12/2021 12:34 PM
67.Compressed Trie.mp443,018 KB12/12/2021 12:34 PM
68.Introduction to Ternary Search Tries.mp463,926 KB12/12/2021 12:34 PM
69.Searching in Ternary Search Tries.mp493,080 KB12/12/2021 12:34 PM
7.Minimum and maximum nodes in an AVL tree of height h.mp4275,168 KB12/12/2021 12:34 PM
70.Insertion in Ternary Search Tries.mp444,290 KB12/12/2021 12:34 PM
71.Deletion in Ternary Search Tries.mp439,492 KB12/12/2021 12:34 PM
72.Comparison of Standard Tries with Ternary Search Tries.mp413,874 KB12/12/2021 12:34 PM
73.Data Structure for Disjoint Sets.mp456,702 KB12/12/2021 12:34 PM
74.Operations on Disjoint Sets.mp469,338 KB12/12/2021 12:34 PM
75.Linked List representation of Disjoint Sets.mp475,026 KB12/12/2021 12:34 PM
76.Time complexity for linked list representation of Disjoint Sets.mp477,963 KB12/12/2021 12:34 PM
77.Amortized analysis of Disjoint Sets using linked list representation.mp4100,908 KB12/12/2021 12:34 PM
78.Disjoint set forest.mp469,342 KB12/12/2021 12:34 PM
79.Union by rank.mp437,706 KB12/12/2021 12:34 PM
8.Introduction to Red Black Trees.mp4104,206 KB12/12/2021 12:34 PM
80.Analysis union by rank.mp4170,078 KB12/12/2021 12:34 PM
81.Path compression.mp493,562 KB12/12/2021 12:34 PM
82.Time complexity using the Heuristics.mp481,040 KB12/12/2021 12:34 PM
83.Kruskal's algorithm using Disjoint sets.mp4102,929 KB12/12/2021 12:34 PM
84.Example on kruskal's using Disjoint sets.mp4127,971 KB12/12/2021 12:34 PM
85.Connected componands using Disjoints.mp467,663 KB12/12/2021 12:34 PM
86.Example on connected components using Disjoint sets.mp469,151 KB12/12/2021 12:34 PM
87.Introduction to Fibonacci Heap.mp447,579 KB12/12/2021 12:34 PM
88.Structure of Fibonacci Heap.mp4113,492 KB12/12/2021 12:34 PM
89.Insert, find, min, Union.mp4144,724 KB12/12/2021 12:34 PM
9.Search,findmax,findmin in Red Black trees.mp425,559 KB12/12/2021 12:34 PM
90.Extract Min.mp4140,307 KB12/12/2021 12:34 PM
91.Decrease Key.mp466,648 KB12/12/2021 12:34 PM
92.Fibonacci Heap Delete.mp432,285 KB12/12/2021 12:34 PM
Deletion in Red Black Trees (Case - 5).mp4162,521 KB12/12/2021 12:34 PM