public int maxDepth(TreeNode root) {
int depth = 0;
if(root == null){
depth = 0;
}
/*else if(root.left == null & root.right==null){
depth= 1;
}*/
else{
depth = Math.max(maxDepth(root.left), maxDepth(root.right))+1;
}
return depth;
}
21天刷题计划之17.1—maximum-depth-of-binary-tree(二叉树的最大深度)(Java语言描述)
猜你喜欢
转载自blog.csdn.net/justlikeu777/article/details/83304308
今日推荐
周排行