Leetcode 111. Minimum Depth of Binary Tree (Python)

preview_player
Показать описание
Leetcode 111. Minimum Depth of Binary Tree (Python)

In this video, I solve the Leetcode Minimum Depth of Binary Tree problem using breadth first search (BFS).
You can find code on my(Ravina Gaikawad) GitHub repository. Find the link below.

If you have any algorithm problems please let me know in the comments below. Also, if you know any other way to solve this problem in an optimized way then let me know.

Ravina Gaikawad
Pseudocoder

#codinginterview #algorithm #leetcode #python #programming #faang #dsa #youtubevideo #pseudocoder #codinginterview #algorithm #leetcode #python #programming #faang #dsa #youtubevideo #pseudocoderravina #education #job #jobapplication #jobsearch #interview #algo #datastructures #dsalgo #interviewquestions #interviewpreparation #easy #easytech #software #softwareengineer #heap #pythonprogramming #tree #binarytree #dfs #bfs #depthfirstsearch #breadthfirstsearch
Рекомендации по теме
Комментарии
Автор

could you please use a better mike so that the audio becomes much more clearer

KAVINSAGARR
Автор

Hi Ravina, Do you have any plans for Ph.D. or you will continue your career in tech?
Could you also share with the viewers how are you preparing for coding interviews?

ubntuusr
Автор

Please Help me 🤌 I need a teacher who can help me to get into google .I just want you to guide me, motivate me . A have a goal to achieve if i do not get google i will be broken .please help me a little bit . How can i contact YOU ??

subhashkr
welcome to shbcf.ru