Leetcode - Minimum Depth of Binary Tree (Python)

preview_player
Показать описание
October 2020 Leetcode Challenge
Leetcode - Minimum Depth of Binary Tree # 111
Рекомендации по теме
Комментарии
Автор

this is the only non-recursive but div&conq dfs solution I ever found, gj!

cgqqqq
Автор

I started with DFS too! Also I think your video is frozen. But I can hear you just fine

janmichaelaustria
Автор

Why are we using popleft() instead of pop().Why are we only popping the leftmost

ayisiebenezer
Автор

Hi! May you please explain why we need to use self.small = min(self.small, num)? Btw thank you so much! Your videos help a lot 👍

HangNguyen-kyfo