思路:
通过递归搜索每个结点的左右孩子,如果左子树或右子树不为空,深度就加1,然后和当前的最大深度比较,如果大就替换最大深度,直到遍历完整棵树
代码:
class Solution {
int maxHigh = 0;
public int maxDepth(TreeNode root) {
if(root == null) return 0;
getHigh(root,0);
return maxHigh;
}
public void getHigh(TreeNode root,int high){
high++;
maxHigh = Math.max(high,maxHigh);
if(root.left != null) getHigh(root.left,high);
if(root.right != null) getHigh(root.right,high);
}
}