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.

Subscribeto see which companies asked this question.

Hide Tags

Tree

Depth-first Search

Hide Similar Problems

(E) Balanced Binary Tree

(E) Minimum Depth of Binary Tree

/**
 * Definition for a binary tree node.
 * 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;
        else{
            return Math.max(maxDepth(root.left), maxDepth(root.right)) + 1;
        }
    }
}