/*

Author: King, wangjingui@outlook.com

Date: Dec 25, 2014

Problem: Maximum Depth of Binary Tree

Difficulty: Easy

Source: https://oj.leetcode.com/problems/maximum-depth-of-binary-tree/

Notes:

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.

Solution: Recursion.

*/

/**

* Definition for binary tree

* public class TreeNode {

* int val;

* TreeNode left;

* TreeNode right;

* TreeNode(int x) { val = x; }

* }

*/

public class Solution {

public int maxDepth(TreeNode root) {

if (root == null) return 0;

int left = maxDepth(root.left);

int right = maxDepth(root.right);

return Math.max(left, right) + 1;

}

}