LeetCode 104. Maximum Depth of Binary Tree

分析

难度 易
来源
https://leetcode.com/problems/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.
Note: A leaf is a node with no children.

Example:

Given binary tree [3,9,20,null,null,15,7],
  3
  /  \
9   20
   /  \
  15  7
return its depth = 3.

解答

Runtime: 0 ms, faster than 100.00% of Java online submissions for Maximum Depth of Binary Tree.

package LeetCode;

public class L104_MaxDepthOfBinaryTree {
    public int maxDepth(TreeNode root) {
        if(root==null){
            return 0;
        }
        int depth=1;
        depth+=Math.max(maxDepth(root.left),maxDepth(root.right));
        return depth;
    }
}