CSE222A 20220223

00:52 CSE 280
01:52 questions
02:16 treeinit
04:01 tree traversal (NLR etc)
06:54 deleting a node from a tree
09:23 3 special cases
21:55 Dynamic Programming
35:29 recursion tree
37:58 caching of results
44:39 recursive structure + repeated subcases
47:33 knapsack problem
53:47 greedy algorithm
57:55 break
1:04:21 innteger knkapsack example
1:18:35 example with numbers
1:28:09 pcode
1:31:45 implementation details
1:41:39 rod cutting
1:51:41 Ackermann Function