队列,将树进行层序遍历,获取树的深度;另一种方式是递归方式,这里则不进一步写明了
# class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None # # 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可 # # # @param pRoot TreeNode类 # @return int整型 # import queue class Solution: def TreeDepth(self , pRoot: TreeNode) -> int: # write code here if not pRoot: return 0 queue_ = queue.Queue() queue_.put(pRoot) count = 0 while not queue_.empty(): n = queue_.qsize() for _ in range(n): node = queue_.get() if node.left: queue_.put(node.left) if node.right: queue_.put(node.right) count += 1 return count