Amanpreet Kapoor
Amanpreet Kapoor
  • 89
  • 132 151
Heaps (5c): Insertion
Heaps (5c): Insertion
zhlédnutí: 1 898

Video

Trees (4e): AVL Trees Insertion11:30Trees (4e): AVL Trees Insertion
Trees (4e): AVL Trees Insertion
zhlédnutí 2KPřed měsícem
Trees (4e): AVL Trees Insertion
Trees (3b): Tree Terminology13:31Trees (3b): Tree Terminology
Trees (3b): Tree Terminology
zhlédnutí 1,5KPřed měsícem
Trees (3b): Tree Terminology
Trees (4h): B and B+ Trees Insertion11:53Trees (4h): B and B+ Trees Insertion
Trees (4h): B and B+ Trees Insertion
zhlédnutí 1,8KPřed měsícem
Trees (4h): B and B Trees Insertion
Trees (3e): BST Delete9:15Trees (3e): BST Delete
Trees (3e): BST Delete
zhlédnutí 1,9KPřed měsícem
Trees (3e): BST Delete
Trees (4b): Performance of BST7:53Trees (4b): Performance of BST
Trees (4b): Performance of BST
zhlédnutí 1,5KPřed měsícem
Trees (4b): Performance of BST
Trees (4f): Fixing BST by Altering Structure6:57Trees (4f): Fixing BST by Altering Structure
Trees (4f): Fixing BST by Altering Structure
zhlédnutí 1,6KPřed měsícem
Trees (4f): Fixing BST by Altering Structure
Heaps (5e): Heap Sort11:48Heaps (5e): Heap Sort
Heaps (5e): Heap Sort
zhlédnutí 1,8KPřed měsícem
Heaps (5e): Heap Sort
Heaps (5a): Priority Queues12:39Heaps (5a): Priority Queues
Heaps (5a): Priority Queues
zhlédnutí 3,5KPřed měsícem
Heaps (5a): Priority Queues
Trees (4i): B+ Tree Question, Use Cases and Performance11:21Trees (4i): B+ Tree Question, Use Cases and Performance
Trees (4i): B+ Tree Question, Use Cases and Performance
zhlédnutí 1,4KPřed měsícem
Trees (4i): B Tree Question, Use Cases and Performance
Heaps (5b): Properties11:01Heaps (5b): Properties
Heaps (5b): Properties
zhlédnutí 2KPřed měsícem
Heaps (5b): Properties
Graphs (8a): Graphs Terminology19:56Graphs (8a): Graphs Terminology
Graphs (8a): Graphs Terminology
zhlédnutí 2,5KPřed měsícem
11:13 B is adjacent to A but A is not adjacent to B. Typo. 16:43 The cycle is ABEDA and not ABCDA. That is an error.
Trees (4d): AVL Trees and Properties11:48Trees (4d): AVL Trees and Properties
Trees (4d): AVL Trees and Properties
zhlédnutí 2KPřed měsícem
At 8:09 there is a typo in the slides, the tables last row should be "Right Left" instead of "Right"
Graphs (8c): Graphs Problems10:52Graphs (8c): Graphs Problems
Graphs (8c): Graphs Problems
zhlédnutí 1,4KPřed měsícem
Graphs (8c): Graphs Problems
Trees (3g): Tree Representation and Traversal Use Cases10:02Trees (3g): Tree Representation and Traversal Use Cases
Trees (3g): Tree Representation and Traversal Use Cases
zhlédnutí 1,4KPřed měsícem
Trees (3g): Tree Representation and Traversal Use Cases
Trees (4c): Rotations as Tools15:51Trees (4c): Rotations as Tools
Trees (4c): Rotations as Tools
zhlédnutí 2,2KPřed měsícem
Trees (4c): Rotations as Tools
Trees (4j): Splay Trees8:16Trees (4j): Splay Trees
Trees (4j): Splay Trees
zhlédnutí 1,4KPřed měsícem
Trees (4j): Splay Trees
Trees (3f): Traversals21:10Trees (3f): Traversals
Trees (3f): Traversals
zhlédnutí 2,4KPřed měsícem
Trees (3f): Traversals
Heaps (5d): Deletion8:07Heaps (5d): Deletion
Heaps (5d): Deletion
zhlédnutí 2,1KPřed měsícem
Heaps (5d): Deletion
Trees (3a): Trees and Use Cases8:11Trees (3a): Trees and Use Cases
Trees (3a): Trees and Use Cases
zhlédnutí 2,2KPřed měsícem
Trees (3a): Trees and Use Cases
Trees (3c): Types of Trees14:31Trees (3c): Types of Trees
Trees (3c): Types of Trees
zhlédnutí 1,7KPřed měsícem
Trees (3c): Types of Trees
Trees (4g): B Tree Properties15:53Trees (4g): B Tree Properties
Trees (4g): B Tree Properties
zhlédnutí 1,8KPřed měsícem
During explanation, at 10:24, "the leaf nodes have [l/2, l] keys", taking a ceil of l/2 is correct. After a lot of research, I have concluded that the property is not strictly enforced (see Wikipedia page for B Trees for conflicting implementation or interpretations). The figure on the right or the 2-3-4 tree does not follow this property. For the sake of the course, we will not follow this pro...
Graphs (8g): Adjacency List19:33Graphs (8g): Adjacency List
Graphs (8g): Adjacency List
zhlédnutí 2,7KPřed měsícem
Graphs (8g): Adjacency List
Graphs (8h): Graph Traversals11:16Graphs (8h): Graph Traversals
Graphs (8h): Graph Traversals
zhlédnutí 2,4KPřed měsícem
Graphs (8h): Graph Traversals
Graphs (8f): Adjacency Matrix20:39Graphs (8f): Adjacency Matrix
Graphs (8f): Adjacency Matrix
zhlédnutí 1,8KPřed měsícem
Graphs (8f): Adjacency Matrix
Graphs (8l): Dijkstras Algorithm Pseudocode14:24Graphs (8l): Dijkstras Algorithm Pseudocode
Graphs (8l): Dijkstras Algorithm Pseudocode
zhlédnutí 1,7KPřed měsícem
Graphs (8l): Dijkstras Algorithm Pseudocode
Graphs (8j): s-t Path19:20Graphs (8j): s-t Path
Graphs (8j): s-t Path
zhlédnutí 2,4KPřed měsícem
Graphs (8j): s-t Path
Sorting (6j): Quick Sort Code9:45Sorting (6j): Quick Sort Code
Sorting (6j): Quick Sort Code
zhlédnutí 1,1KPřed měsícem
Sorting (6j): Quick Sort Code
Sorting (6c): Bubble Sort10:57Sorting (6c): Bubble Sort
Sorting (6c): Bubble Sort
zhlédnutí 1,3KPřed měsícem
Sorting (6c): Bubble Sort
Sorting (6e): Shell Sort15:24Sorting (6e): Shell Sort
Sorting (6e): Shell Sort
zhlédnutí 1,4KPřed měsícem
Sorting (6e): Shell Sort

Komentáře

  • @kidyoshi007
    @kidyoshi007 Před 5 měsíci

    🔥🔥🔥

  • @alexbarreto3718
    @alexbarreto3718 Před rokem

    Hi Professor Kapoor, why wouldn't the printing of the set be =.c 50, a 40, b 30? I'm a little bit confused about how the printing order for the unordered set works

  • @octavio.anino.1626
    @octavio.anino.1626 Před 2 lety

    Line 18 in the adjacency list implementation is amazing. Creating a new key-value pair using just square bracket operators, and then initializing the value to an empty vector using just a pair of empty curly brackets. C++ is great.

  • @octavio.anino.1626
    @octavio.anino.1626 Před 2 lety

    For those who may have been confused like I was at 6:45. From the definition of the operation, the Node required is passed to AddBefore(). The operation does not need to find the required Node. Then, as explained prior to 6:45, insertion into a doubly linked list takes constant time.

  • @amanpreetkapoor6490
    @amanpreetkapoor6490 Před 3 lety

    If anyone needs to access the links, here they are: cplusplus.com/reference/map/map cplusplus.com/reference/unordered_map/unordered_map

  • @amanpreetkapoor6490
    @amanpreetkapoor6490 Před 3 lety

    If anyone needs to access the links, here they are: cplusplus.com/reference/set/set/ cplusplus.com/reference/unordered_set/unordered_set/ onlinegdb.com/SyMCuHOlD

  • @OppositeOfChill
    @OppositeOfChill Před 4 lety

    It looks like the link in the video doesn't lead to anything: onlinegdb.com/BJGAP7151