二叉树的最大深度
题目描述:
给定一个二叉树,找出其最大深度。二叉树的深度为根节点到最远叶子节点的最长路径上的节点数。
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
int maxDepath;
public int maxDepth(TreeNode root) {
if(root == null) return 0;
helper(root,0);
return maxDepath;
}
private void helper(TreeNode root,int curDepath){
if(root == null){
if(curDepath > maxDepath) maxDepath = curDepath;
return;
}
helper(root.left,curDepath+1);
helper(root.right,curDepath+1);
}
}
按照题意,递归即可,定义一个全局最大的深度的变量。详细请看代码,有疑问欢迎留言。