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.

SRE实战 互联网时代守护先锋，助力企业售后服务体系运筹帷幄！一键直达领取阿里云限量特价优惠。

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.

 

题意：

求二叉树最大深度

 

Solution1： DFS

 

code

 1 /**
 2  * Definition for a binary tree node.
 3  * public class TreeNode {
 4  *     int val;
 5  *     TreeNode left;
 6  *     TreeNode right;
 7  *     TreeNode(int x) { val = x; }
 8  * }
 9  */
10 class Solution {
11     public int maxDepth(TreeNode root) {
12         if(root == null) return 0;
13        
14         int maxLeft = maxDepth(root.left);
15         int maxRight = maxDepth(root.right);
16     
17         return Math.max(maxLeft, maxRight)+1;
18     }
19 }

 

扫码关注我们
微信号：SRE实战
拒绝背锅 运筹帷幄