##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
What this section covers
Trees and graphs appear in about - of Amazon coding rounds. This section has problems covering BFS, DFS, tree recursion, and graph traversal.
Three are from [[u:/roadmaps/pattern-22|Pattern ]] and one from the MAANG roadmap. You'll find existing walkthroughs here (Subtree and Copy List) plus new problems worked out in full.
