Interview Questions | Maximum Depth of Binary Tree | DFS | JavaScript | NodeJS | leetcode | Trees
"Given the root of a binary tree, return its maximum depth.
A binary tree's maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node."
In this video, I have described the solution with the DFS approach (Depth-first search) in the recursive and non-recursive way.