思路
代码
class Solution {
public int maxDepth(TreeNode root) {
if(root==null)return 0;
int h=0;
Queue<TreeNode> q=new LinkedList<TreeNode>();
q.offer(root);
while(!q.isEmpty()){
int n=q.size();
while(n>0){
TreeNode node=q.poll();
if(node.left!=null)q.offer(node.left);
if(node.right!=null)q.offer(node.right);
n--;
}
h++;
}
return h;
}
}
class Solution {
public int maxDepth(TreeNode root) {
if (root == null) {
return 0;
} else {
int leftHeight = maxDepth(root.left);
int rightHeight = maxDepth(root.right);
return Math.max(leftHeight, rightHeight) + 1;
}
}
}