leetcode | Maximum Depth of Binary Tree

来源:互联网 发布:淘宝积分不能登录 编辑:程序博客网 时间:2024/06/18 16:31

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) {        if(root==null)            return 0;        int l = maxDepth(root.left);        int r = maxDepth(root.right);        return l>r?l+1:r+1;    }}


0 0
原创粉丝点击