一、题目
二、代码
/**
* 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
{
//最大深度 层序遍历
public int maxDepth(TreeNode root)
{
if(root==null) return 0;
int deepth = 0;
int i;
Queue<TreeNode> re = new LinkedList<>();
re.offer(root);
while(!re.isEmpty())
{
deepth++;
int length = re.size();
for(i=0;i<length;i++)
{
TreeNode temp = re.poll();
if(temp.left!=null) re.offer(temp.left);
if(temp.right!=null) re.offer(temp.right);
}
}
return deepth;
}
}