LeetCode 104. Maximum Depth of Binary Tree

标签：mis   from   fast   ems   解答   ons   -o   strong   tco   

分析

难度 易

来源

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.

 1 package LeetCode;
 2 
 3 public class L104_MaxDepthOfBinaryTree {
 4     public int maxDepth(TreeNode root) {
 5         if(root==null){
 6             return 0;
 7         }
 8         int depth=1;
 9         depth+=Math.max(maxDepth(root.left),maxDepth(root.right));
10         return depth;
11     }
12 }

LeetCode 104. Maximum Depth of Binary Tree

标签：mis   from   fast   ems   解答   ons   -o   strong   tco   

原文地址：https://www.cnblogs.com/flowingfog/p/9879052.html