It helps to have read 3.1 Graph search: BFS and DFS and 3.4 Dynamic programming I. Overall level: Advanced.
Practice this topic
Four coding problems for Trees · 0 of 4 solved