题解 | #二叉树的深度#

使用双端队列，层次遍历

# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None
#
# 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
#
# 
# @param pRoot TreeNode类 
# @return int整型
#
from collections import deque
class Solution:
    def TreeDepth(self , pRoot: TreeNode) -> int:
        if not pRoot:return 0
        queue = deque([(pRoot,1)])
        while queue:
            node,depth = queue.popleft()
            if node.left:queue.append((node.left,depth+1))
            if node.right:queue.append((node.right,depth+1))
        return depth