| parent,child |
| Data Structures and Algorithms,Running Time Analysis |
| Data Structures and Algorithms,Divide and Conquer |
| Data Structures and Algorithms,Sorting Algorithms |
| Data Structures and Algorithms,Heap and Heap Sort |
| Data Structures and Algorithms,Linear Data Structure |
| Data Structures and Algorithms,C++ |
| Data Structures and Algorithms,Hash Tables |
| Data Structures and Algorithms,Dynamic Programming |
| Data Structures and Algorithms,Greedy Algorithms |
| Data Structures and Algorithms,Graph Algorithms |
| Running Time Analysis,Asymtotic Notation |
| Asymtotic Notation,Big O Notation |
| Big O Notation,Big O Simplification Rules |
| Asymtotic Notation,Big Omega Notation |
| Asymtotic Notation,Big Theta Notation |
| Divide and Conquer,Steps of Divide and Conquer |
| Steps of Divide and Conquer,Divide |
| Steps of Divide and Conquer,Conquer |
| Steps of Divide and Conquer,Combine |
| Divide and Conquer,D&C Time Complexity and Recurrence |
| D&C Time Complexity and Recurrence,Recurrence of Divide and Conquer |
| Recurrence of Divide and Conquer,Solving Recurrences |
| Solving Recurrences,Recursion Tree Method |
| Solving Recurrences,Master Method |
| D&C Time Complexity and Recurrence,Running Time of D&C Algorithm |
| Running Time of D&C Algorithm,Running Time of Quick Sort |
| Running Time of D&C Algorithm,Running Time of Merge Sort |
| Divide and Conquer,Algorithms with Divide and Conquer |
| Algorithms with Divide and Conquer,Binary Search |
| Algorithms with Divide and Conquer,The maximum Subarray Sum |
| Algorithms with Divide and Conquer,Multiplication Problem |
| Divide and Conquer,Sorting by Divide and Conquer |
| Sorting by Divide and Conquer,Merge Sort |
| Merge Sort,Running Time of Merge Sort |
| Sorting by Divide and Conquer,Quick Sort |
| Quick Sort,Running Time of Quick Sort |
| Quick Sort,Randomized Quick Sort |
| Sorting Algorithms,Slow Sorting Algorithms |
| Slow Sorting Algorithms,Selection Sort |
| Slow Sorting Algorithms,Bubble Sort |
| Slow Sorting Algorithms,Insertion Sort |
| Sorting Algorithms,Fast Sorting Algorithms |
| Fast Sorting Algorithms,Sorting by Divide and Conquer |
| Sorting Algorithms,Best-Case VS. Worst-Case Input |
| Heap and Heap Sort,Heap |
| Heap,Heap Structure |
| Heap Structure,Max-Heap |
| Heap Structure,Min-Heap |
| Heap,Heap Property |
| Heap Property,Maintaining the Heap Property |
| Heap,Priority Queue |
| Heap,Heap Operations |
| Heap Operations,Get-Max() |
| Heap Operations,Extract-Max() |
| Heap Operations,Update-Key() |
| Heap Operations,Insert-Key() |
| Heap Operations,Build-Max-Heap() |
| Build-Max-Heap(),HeapSort |
| Heap,Heap Sort |
| Linear Data Structure,Stack |
| Stack,LIFO |
| Stack,Stack Array Implementation |
| Stack Array Implementation,Stack Instance Variables |
| Stack Array Implementation,Stack Operations |
| Stack Operations,push() |
| Stack Operations,pop() |
| Stack Array Implementation,Stack Auxiliary Operations |
| Linear Data Structure,Queue |
| Queue,FIFO |
| Queue,Queue Array Implementation |
| Queue Array Implementation,Queue Instance Variables |
| Queue Array Implementation,Queue Operations |
| Queue Operations,enqueue() |
| Queue Operations,dequeue() |
| Queue Array Implementation,Queue Auxiliary Operations |
| Linear Data Structure,Linked List |
| Linked List,Pointers |
| Pointers,Components of Pointer |
| Pointers,Declaration of a pointer |
| Pointers,Operations on pointer |
| Pointers,The nullptr value |
| Linked List,Components of a node |
| Linked List,Linked list Operations |
| Linked list Operations,search() |
| Linked list Operations,insert() |
| Linked list Operations,remove() |
| Linked List,Variants of Linked Lists |
| Linear Data Structure,Tree |
| Tree,Binary Search Tree |
| Binary Search Tree,Queries of Interest |
| Binary Search Tree,BST Operations |
| BST Operations,BST Search |
| BST Operations,BST Maximum and Minimum |
| BST Maximum and Minimum,BST Minimum |
| BST Maximum and Minimum,BST Maximum |
| BST Operations,BST Successor and Predecessor |
| BST Successor and Predecessor,BST Successor |
| BST Successor and Predecessor,BST Predecessor |
| BST Operations,BST Insertion |
| BST Operations,BST Deletion |
| BST Deletion,BST Transplant |
| Binary Search Tree,Self-Balancing BST |
| Self-Balancing BST,AVL Tree |
| AVL Tree,Height of AVL Tree |
| AVL Tree,Insertion in AVL Tree |
| AVL Tree,Left Rotation |
| AVL Tree,Right Rotation |
| AVL Tree,AVL Tree Deletion |
| Tree,Binary Tree |
| Binary Tree,Traversal |
| Traversal,Inorder |
| Inorder,Inorder Time Complexity |
| Traversal,Preorder |
| Traversal,Postorder |
| Linear Data Structure,Heap |
| C++,Classes VS. Objects |
| Classes VS. Objects,Class Definition |
| Classes VS. Objects,Object's method |
| Hash Tables,Hash Function |
| Hash Function,Linear Probing |
| Hash Function,Quadratic Probing |
| Hash Function,Double Hashing |
| Hash Tables,Hash Table Structure |
| Hash Tables,Hash Table Collision |
| Hash Tables,Hash Table with Chaining |
| Hash Table with Chaining,Chaining Search |
| Hash Table with Chaining,Chaining Insert |
| Hash Table with Chaining,Chaining Delete |
| Hash Table with Chaining,Chaining Cost Analysis |
| Hash Tables,Hash Table with Open Addressing |
| Hash Table with Open Addressing,Open Addressing Insert |
| Hash Table with Open Addressing,Open Addressing Search |
| Hash Table with Open Addressing,Open Addressing Delete |
| Hash Table with Open Addressing,Hash Function |
| Hash Table with Open Addressing,Open Addressing Cost Analysis |
| Dynamic Programming,Two key gradients for DP |
| Two key gradients for DP,Optimal Substructure |
| Two key gradients for DP,Overlapping Subproblems |
| Dynamic Programming,Four Steps in DP |
| Dynamic Programming,DP VS. Greedy |
| Greedy Algorithms,DP VS. Greedy |
| Greedy Algorithms,Elements of Greedy Strategy |
| Greedy Algorithms,Greedy-Choice Property |
| Greedy Algorithms,Optimal Substructure for Greedy |
| Graph Algorithms,Weighted Vs. Unweighted |
| Graph Algorithms,Directed VS. Undirected |
| Directed VS. Undirected,Node Neighbors and Degree |
| Directed VS. Undirected,Paths |
| Graph Algorithms,Graph Data Structures |
| Graph Algorithms,Graph Traversal |
| Graph Traversal,Algorithms for Graph Traversal |
| Algorithms for Graph Traversal,Breadth-First Search |
| Breadth-First Search,BFS Algorithm |
| Algorithms for Graph Traversal,Depth-First Search |
| Depth-First Search,DFS Algorithm |
| |
