zoukankan      html  css  js  c++  java
  • [leedcode 104] 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.

    /**
     * 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) {
            //求最大深度(高度),使用递归,分别求左子树和右子树的深度,取最大的+1
            if(root==null) return 0;
            return Math.max(maxDepth(root.left),maxDepth(root.right))+1;
            
        }
    }
  • 相关阅读:
    37.js----浅谈js原型的理解
    iOS
    iOS
    iOS
    python3
    ios
    iOS
    python3
    python3
    iOS
  • 原文地址:https://www.cnblogs.com/qiaomu/p/4662825.html
Copyright © 2011-2022 走看看