# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, val=0, left=None, right=None):
# self.val = val
# self.left = left
# self.right = right
from collections import deque
class Solution:
def maxDepth(self, root: Optional[TreeNode]) -> int:
# 为空处理
if not root:
return 0
depth=0
que=deque()
que.append(root)
while que:
depth+=1
size=len(que)
for i in range(size):
node=que.popleft()
if node.left:
que.append(node.left)
if node.right:
que.append(node.right)
return depth