首页 > 代码库 > leetcode--Maximum Depth of Binary Tree
leetcode--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.
?
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 | /** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */ public class Solution { /**This is a fundamental problem on recursive method.<br> * @param root --the root node of a tree * @return max depth * @author Averill Zheng * @version 2014-06-03 * @since JDK 1.7 */ public int maxDepth(TreeNode root) { int maxDepth = 0 ; if (root != null ){ if (root.left == null ) maxDepth = 1 + maxDepth(root.right); else if (root.right == null ) maxDepth = 1 + maxDepth(root.left); else maxDepth = 1 + Math.max(maxDepth(root.left), maxDepth(root.right)); } return maxDepth; } } |
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。