Recap BST: Search, Insert, Delete in RB-Tree: Duplicates Want to store a set of numbers...
![240](https://cdn2.jianshu.io/assets/default_avatar/15-a7ac401939dd4df837e3bbf82abaa2a8.jpg?imageMogr2/auto-orient/strip|imageView2/1/w/240/h/240)
Recap BST: Search, Insert, Delete in RB-Tree: Duplicates Want to store a set of numbers...
Directed and non-directed graphs Directed Graph is strongly connected if there is a pat...
ComplexityO(n+1)n+O(n)+O(m) = O(n^2) failed if negative edges ComplexityO(n) + n(O(m+n)...
Problem 1 Input Binary tree T Out True if the tree is BST, False otherwise Incorrect So...
Randomized Algorithms basic prob Problem 2 Input Array A[1..2n] with n X's and n Y's Ou...
Divide & Conquer Example: Binary Search Given sorted A[1..n] and number x. Find out whe...
Divide and conquer Merge sort Binary search Stock price VP1 on A[1..n/2] VP2 on A[n/2+1...
Talked about the notation.Some logarithms, e.g., Complexities worst case best case ave...
Recursion Big-O and notation Properties: ignore slow-growing things reason about relaa...
Recursion Exponentiation Problem Input Positive integers: b and n Output Puesdocode Mul...