分别用BFS和递归求解,BFS每次将一个节点入队,遍历过程中每次将该节点出队并依次判断该节点是否为叶子结点,若是则结束遍历并返回当前深度,若有子节点则将子节点入队然后将当前深度+1继续下一次遍历
递归函数定义为考虑以当前root为根节点的二叉树的深度
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
#BFS
import queue
class Solution:
if not root: return 0
if not root.left and not root.right: return 1
#BFS
q = queue.Queue()
q.put(root)
depth = 1
while q:
sz = q.qsize()
for i in range(0, sz):
cur = q.get()
if cur.left == None and cur.right == None:
return depth
if cur.left:
q.put(cur.left)
if cur.right:
q.put(cur.right)
depth += 1
return depth
#Recursive
class Solution:
def minDepth(self, root: TreeNode) -> int:
if not root: return 0
if not root.left and not root.right: return 1
if not root.left:
return 1 + self.minDepth(root.right)
if not root.right:
return 1 + self.minDepth(root.left)
return 1 + min(self.minDepth(root.left), self.minDepth(root.right))