leetcode-binary-tree-max-depth

2017-08-25
#java
leetcode binary tree

Given a binary tree, find its maximum depth.

The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.

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.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public int maxDepth(TreeNode root) {
        
        if(root == null) return 0;
        
        int left = this.maxDepth(root.left);
        int right = this.maxDepth(root.right);
        
        if(left > right){
            return left + 1;
        }else{
            return right+1;
        }
    }
}