首页 > 代码库 > 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.
Solution:
1 /** 2 * Definition for binary tree 3 * public class TreeNode { 4 * int val; 5 * TreeNode left; 6 * TreeNode right; 7 * TreeNode(int x) { val = x; } 8 * } 9 */10 public class Solution {11 public int maxDepth(TreeNode root) {12 return maxDepthRecur(root); 13 }14 15 public int maxDepthRecur(TreeNode curNode){16 if (curNode==null) return 0;17 18 int depth = Math.max(maxDepthRecur(curNode.left),maxDepthRecur(curNode.right))+1;19 return depth;20 21 } 22 }
Leetcode-Maximum Depth of Binary Tree
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。