[LeetCode] NO.104 Maximum Depth of 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.

 

[题目解析] 这是一道很常见也很简单的题目。直接看代码吧。

private class TreeNode {
    int val;
    TreeNode left;
    TreeNode right;
    TreeNode(int x) {val = x;}
}

public int maxDepth(TreeNode root) {
    if(null == root) return 0;
    int leftDepth = maxDepth(root.left);
    int rightDepth = maxDepth(root.right);
    return leftDepth > rightDepth ? leftDepth+1:rightDepth+1; 
}