leetcode/#104-binary-tree-depth.java at main · Eric-Ptn/leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */

class Solution {
    public int maxDepth(TreeNode root) {

        if(root == null){
            return 0;
        }

        int maxDepth = 1 + Math.max(maxDepth(root.right), maxDepth(root.left));
        return maxDepth;

    }

}