This is the simplest tree recursion problem. Every company uses it to check if you understand recursive thinking. The pattern here (base case + combine subtree results) applies to almost every tree problem: diameter, balanced check, path sum, subtree matching. If you find this problem hard, you're not ready for harder tree problems. Learn the recursive pattern: think about what you need from your children and what you return to your parent.
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
$ curl repovive.com/roadmaps/maang-interview-prep/trees-bst/maximum-depth-of-binary-tree-why-this-problem
░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░█████████████████████████████████████████████████████████████████████████████████████████████████████████