Maximum Depth of Binary Tree

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.

 

/**
 * 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(null == root)
            return 0;
        else{
            int max = maxDepth(root.left);
            int temp = maxDepth(root.right);
            if(max < temp){
                max = temp;
            }
            return max + 1;
        }
    }
}