Implement it on LeetCode. There's also an iterative BFS approach: text function maxDepth(root): if root == null: return 0 queue = [root] depth = 0 while queue not empty: depth++ process all nodes at this level add their children to queue return depth Both approaches work. The recursive approach is cleaner for tree problems.
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
$ curl repovive.com/roadmaps/maang-interview-prep/trees-bst/maximum-depth-of-binary-tree-implementation
░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░███████████████████████████████████████████████████████████████████████████████████████████████████████