首页 > 代码库 > leetcode----------Maximum Depth of Binary Tree
leetcode----------Maximum Depth of Binary Tree
题目 | Maximum Depth of Binary Tree |
通过率 | 44.2% |
难度 | Easy |
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.
题目比较简单,采用递归算法分别求左右子树,最后别忘了+1;
java代码:
/** * Definition for binary tree * 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; else { int leftMax=maxDepth(root.left); int rightMax=maxDepth(root.right); return Math.max(leftMax,rightMax)+1; } }}
leetcode----------Maximum Depth of Binary Tree
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。