[LeetCode] 104. Maximum Depth of Binary Tree (Easy)

 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
26
27
28
29
30
31
32

구현을 못해서 힌트 받고 품
/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public int maxDepth(TreeNode root) {
        if(root == null) return 0;
        return m(root, 0);
    }

    private int m(TreeNode node, int d) {
        if(node == null) return d;
        d = d + 1;
        int l = m(node.left, d);
        int r = m(node.right, d);

        if(l > r) return l;
        else return r;
    }
}