Leetcode 104. Maximum Depth of Binary Tree

<span style="font-family: 'Helvetica Neue', Helvetica, Arial, sans-serif; background-color: rgb(255, 255, 255);">Given a binary tree, find its maximum depth.</span>

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) {
        if(root==null){
            return 0;
        }
        return 1+Math.max(maxDepth(root.left),maxDepth(root.right));
    }
}
需要再看,递归,非自己写出来的。



阅读更多
上一篇Leetcode 258. Add Digits
下一篇Leetcode 226. Invert Binary Tree
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

关闭
关闭