Minimum Depth of Binary Tree | Leetcode-111 | BFS | DFS | AMAZON | Explanation ➕ Live Coding

Показать описание

Hi everyone, this is the 28th video of our "Binary Tree" Playlist.
In this video we will try to solve a BFS,DFS Binary Tree Qn “Minimum Depth of Binary Tree”.

We will write very easy and clean code.
We will do live coding after explanation and see if we are able to pass all the test cases.

Problem Name : Minimum Depth of Binary Tree
Company Tags : AMAZON

╔═╦╗╔╦╗╔═╦═╦╦╦╦╗╔═╗
║╚╣║║║╚╣╚╣╔╣╔╣║╚╣═╣
╠╗║╚╝║║╠╗║╚╣║║║║║═╣
╚═╩══╩═╩═╩═╩╝╚╩═╩═╝

#coding #helpajobseeker #easyrecipes #leetcode #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge #leetcodequestions #leetcodechallenge #hindi #india #hindiexplanation #hindiexplained #easyexplaination #interview #interviewtips
#interviewpreparation #interview_ds_algo #hinglish

codestorywithMIK

Рекомендации по теме

Комментарии

Great Explanation!! Please make videos on other topics as well.

pankhurip

Story se Maine bhi code kardiya. Thanks to you ❤

wearevacationuncoverers

Did it under a minute (min/max depth sunte hi dfs ata h dimag mein, thnx for the bfs wali approach)

xiaoshen

badiya question, usse bhi badiya teacher, kudos to u, plz keep posting more questions like these.

DurgaShiva

Please keep adding similar questions!
It's of great help!

AyushRaj-weog

thanks for the explanation. finally an easy one by leetcode

floatingpoint

Bhaiya abhi graphs ki concepts and question series hold PE hai kya?
I've reached till video 20/33 and it's just amazing how clearly and smoothly one is able to grasp the concepts... Thanks a lot 🙏🏻

daayush

Amazing as always. Would like to request again for top interview questions, Sir❤

aman

Mine solution for this Problem

class Solution {
public:
int solve(TreeNode*root){
if(root==NULL)return 1e9;
if(root->left==NULL and root->right==NULL)return 1;
int mini=1e9;
mini=min(mini, 1+solve(root->left));
mini=min(mini, 1+solve(root->right));
return mini;
}
int minDepth(TreeNode* root) {
int ans=solve(root);
ans=ans>=1e9?0:ans;
return ans;
}
};

Anand

Pesudocode of today POTD
If(root==0)
{
Return 0;

// check for the left sub tree

// check for the right sub tree

// After it will check for the condition of from which one will be the minimum

// else it will check for the maximum condition for the both the left sub tree and right sub tree

T.c:- O(N)
S.C :- O(N)

aryamansingha

Can you please give your intuition and your thought process for the Question Minimize the heights I and II of GFG.

monty

bhai, can you cmplete the graph and dp playlist in 2 or 3 weeks ?

tejaspatel

Thanks sir..
Please take the question-- farthest element (using binary search) ... not able to get it....

keerti_

Minimum Depth of Binary Tree | Leetcode-111 | BFS | DFS | AMAZON | Explanation ➕ Live Coding

Leetcode - Minimum Depth of Binary Tree (Python)

Minimum Depth of Binary Tree (LeetCode 111) | Full solution w/ graphical examples | Study Algorithms

MINIMUM DEPTH OF BINARY TREE | LEETCODE # 111 | PYTHON DFS SOLUTION

Minimum Depth of Binary Tree | Leetcode-111 | BFS | DFS | AMAZON | Explanation ➕ Live Coding

LeetCode 111: Minimum Depth of Binary Tree

Maximum Depth of Binary Tree - 3 Solutions - Leetcode 104 - Python

Minimum Depth of Binary Tree - Leetcode 111 - Java

Minimum Depth of Binary Tree - LeetCode 111 - JavaScript

Minimum Depth of Binary Tree - LeetCode 111 - Python

Leetcode 111. Minimum Depth of Binary Tree

Balanced Binary Tree | Minimum Depth of a Binary Tree | LeetCode Java | Geekific

Minimum Depth of Binary Tree Javascript

Minimum Depth of Binary Tree | LeetCode 111 | Coding Interview Tutorial

111. Minimum Depth of Binary Tree - Day 10/31 Leetcode July Challenge

Leetcode 111. Minimum Depth of Binary Tree (Python)

LEETCODE(FAANG)-MINIMUM DEPTH OF BINARY TREE

Minimum Depth of Binary Tree

Minimum Depth of a Binary Tree: Discovering the Shortest Path to Leaf Nodes

111. Minimum Depth of Binary Tree - Day 22/31 Leetcode October Challenge

LeetCode Tutorial 111. Minimum Depth of Binary Tree

Min Depth of Binary Tree l

LeetCode 111. Minimum Depth of Binary Tree | Minimum Depth of Tree

Leetcode 111. Minimum Depth of Binary Tree [Java]

Minimum Depth of Binary Tree | Iterative & Recursive Approach