![Amanpreet Kapoor](/img/default-banner.jpg)
- Видео 89
- Просмотров 132 151
Amanpreet Kapoor
США
Добавлен 13 янв 2012
Видео
Trees (4h): B and B+ Trees Insertion
Просмотров 1,8 тыс.Месяц назад
Trees (4h): B and B Trees Insertion
Trees (4f): Fixing BST by Altering Structure
Просмотров 1,6 тыс.Месяц назад
Trees (4f): Fixing BST by Altering Structure
Trees (4i): B+ Tree Question, Use Cases and Performance
Просмотров 1,4 тыс.Месяц назад
Trees (4i): B Tree Question, Use Cases and Performance
Graphs (8a): Graphs Terminology
Просмотров 2,5 тыс.Месяц назад
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 Properties
Просмотров 2 тыс.Месяц назад
At 8:09 there is a typo in the slides, the tables last row should be "Right Left" instead of "Right"
Trees (3g): Tree Representation and Traversal Use Cases
Просмотров 1,4 тыс.Месяц назад
Trees (3g): Tree Representation and Traversal Use Cases
Trees (4g): B Tree Properties
Просмотров 1,8 тыс.Месяц назад
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 (8l): Dijkstras Algorithm Pseudocode
Просмотров 1,7 тыс.Месяц назад
Graphs (8l): Dijkstras Algorithm Pseudocode
🔥🔥🔥
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
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.
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.
If anyone needs to access the links, here they are: cplusplus.com/reference/map/map cplusplus.com/reference/unordered_map/unordered_map
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
It looks like the link in the video doesn't lead to anything: onlinegdb.com/BJGAP7151
The link is this one: www.onlinegdb.com/BJGAP7I5I