一、题目
二、代码
/**
* 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;
Queue<TreeNode> queue = new LinkedList<>();
queue.offer(root);
int deepth = 0;
while(!queue.isEmpty())
{
deepth++;
int length = queue.size();
int i;
for(i=0;i<length;i++)
{
TreeNode temp_node = queue.poll();
if(temp_node.left!=null) queue.offer(temp_node.left);
if(temp_node.right!=null) queue.offer(temp_node.right);
}
}
return deepth;
}
}
三、运行结果
四、附录
/**
* 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;
Deque<TreeNode> queue1 = new LinkedList<>();
queue1.addFirst(root);
int res = 0;
while(queue1.size()!=0)
{
int i;
int length = queue1.size();
for(i=0;i<length;i++)
{
TreeNode temp = queue1.peekFirst();
queue1.removeFirst();
if(temp.left!=null) queue1.addLast(temp.left);
if(temp.right!= null) queue1.addLast(temp.right);
}
res++;
}
return res;
}
}