Minimum Depth of Binary Tree | Leet code 111 | Theory explained + Python code

This video is a solution to Leet code 111, Minimum Depth of Binary Tree. I explain the question, go over how the logic / theory behind solving the question and finally solve it using Python code.

Comment below if you have a better solution to this problem!

Let me know if you have any feedback and don't forget to subscribe for more videos!

Code:
https://leetcode.com/problems/minimum-depth-of-binary-tree/discuss/905936/Python-BFS-and-DFS-Explained-(video-%2B-code)

Time stamps:
0:00 Question Explained
1:56 BFS Explained
4:13 DFS Explained
5:47 BFS code
8:22 DFS code

More leetcode questions solved:
https://www.youtube.com/watch?v=O5yxoFS_diY&list=PLr9zbByiJa3Ua2AgTrdvot6AQ3b4CxWrF

Gear used:
Mic: https://amzn.to/3awi3b6
Drawing pad: https://amzn.to/2O7PaaU

Видео Minimum Depth of Binary Tree | Leet code 111 | Theory explained + Python code канала Sai Anish Malla