【leetcode】Python實現-111.二叉樹的最小深度

111.二叉樹的最小深度 描述 我python if root is None: return 0 p = [root] current_level_num = 1 next_level_num = 0 i = 1 while p: current = p.pop(0)

>>阅读原文<<