leetcode/solution/104_Maximum_Depth_of_Binary_Tree.java at master · CodexploreRepo/leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
class Solution {
    public int maxDepth(TreeNode root) {
        //DFS: Depth First Search > Recursive Algo

        //Base Case:
        if (root == null){
            return 0;
        }
        //Recursive Case:
        int depthLeft = maxDepth(root.left);
        int depthRight = maxDepth(root.right);

        return Math.max(depthLeft, depthRight) + 1;


    }
}