104. Maximum Depth of Binary Tree

发布时间：2020-12-14 04:38:05 所属栏目：大数据来源：网络整理

导读：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,nul

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,15,7],

    3
   /   9  20
    /     15   7

return its depth = 3.

终极无敌之递归

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

?或者联动Mindepth的方法，检查左右子节点是否为空，一一判断

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

（编辑：李大同）

【声明】本站内容均来自网络，其相关言论仅代表作者个人观点，不代表本站立场。若无意侵犯到您的权利，请及时与联系站长删除相关内容!