题目:
求二叉树的最大深度
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.
Note: A leaf is a node with no children.
Example:
Given binary tree [3,9,20,null,null,15,7]
,
3
/ \
9 20
/ \
15 7
思路:
见剑指offer55 题目一 —— https://blog.csdn.net/qq_22527013/article/details/90767878
代码:
// 2019-06-14
// 0 ms 38.8 MB
class Solution {
public int maxDepth(TreeNode root) {
if(root==null) {
return 0;
}
int base = 1;
if(root.left==null && root.right==null) {
return base;
}
int left = base + maxDepth(root.left);
int right = base + maxDepth(root.right);
if(left>right) {
return left;
}else {
return right;
}
}
}