Find Elements in a Contaminated Binary Tree | BFS | DFS | Leetcode 1261 | codestorywithMIK

Hi Everyone, this is the 55th video of our Playlist "Binary Tree : Popular Interview Problems".
Now we will be solving a good String problem - Find Elements in a Contaminated Binary Tree | BFS | DFS | Leetcode 1261 | codestorywithMIK

Problem Name : Find Elements in a Contaminated Binary Tree | BFS | DFS | Leetcode 1261 | codestorywithMIK
Company Tags : Will update later

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

Video Summary :
DFS Approach:
Start from the root (value 0) and recursively assign values to its children using 2*x + 1 and 2*x + 2.
Store all values in a HashSet for quick lookups.
This ensures a complete reconstruction of the tree using a depth-first manner.

BFS Approach:
Use a queue to process nodes level by level, assigning values iteratively.
Each node’s children get their values and are pushed into the queue.
Like DFS, a HashSet is used for O(1) lookups, but BFS avoids deep recursion issues. 🚀

✨ Timelines✨
00:00 - Introduction
00:16 - Problem Explanation
03:06 - Thought Process
12:29 - Time & Space Complexity
08:55 - Coding DFS
10:28 - Coding BFS

#MIK #mik #Mik
#coding #helpajobseeker #easyrecipes #leetcode #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge #leetcodequestions #leetcodechallenge #hindi #india #coding #helpajobseeker #easyrecipes #leetcode #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge #leetcodequestions #leetcodechallenge #hindi #india #hindiexplanation #hindiexplained #easyexplaination #interview#interviewtips #interviewpreparation #interview_ds_algo #hinglish #github #design #data #google #video #instagram #facebook #leetcode #computerscience #leetcodesolutions #leetcodequestionandanswers #code #learning #dsalgo #dsa #coding #programming #100daysofcode #developers #techjobs #datastructures #algorithms #webdevelopment #softwareengineering #computerscience #pythoncoding #codinglife #coderlife #javascript #datascience #leetcode #leetcodesolutions #leetcodedailychallenge #codinginterview #interviewprep #technicalinterview #interviewtips #interviewquestions #codingchallenges #interviewready #dsa #hindi #india #hindicoding #hindiprogramming #hindiexplanation #hindidevelopers #hinditech #hindilearning #helpajobseeker #jobseekers #jobsearchtips #careergoals #careerdevelopment #jobhunt #jobinterview #github #designthinking #learningtogether #growthmindset #digitalcontent #techcontent #socialmediagrowth #contentcreation #instagramreels #videomarketing #codestorywithmik #codestorywithmick #codestorywithmikc #codestorywitmik #codestorywthmik #codstorywithmik #codestorywihmik #codestorywithmiik #codeistorywithmik #codestorywithmk #codestorywitmick #codestorymik #codestorwithmik

[_gautamkumar]

Hello mik brother, your are DSA god, aapka explaination kabhi acha h, me hamesh wait krta hu aapke video ka perday leetcode challenge. aapke video dekh kr mene aapna dsa acha kiya. aapke wajah se aaj mujhe 5 LPA se 20 LPA package mila. or aage se hamesha aapko follow krunga. aapka perday ka motivation quote se motivation milta h. aap hamesh kush raho or ese hi video banao brother.

Solved on own. Thank you for telling the set stuff😄.

[radhakrishnatelaprolu]

bhayaa pleasee try to resume that Dp conecpts and questions playlist!! that is soo soo soo good!!!pleaseeee

[dibbodas]

thanks bhaiya for your consistency video🔥

[crazygamerrohan]

Eassy ! Solved By using Recursion and Unorderd_map 😍

[abhayshukla]

bhaiya please if possible, teach us OOPs in c++ it will be very helpful as we find it difficult

[Messi]

Today's motivation : Do things in Silence, let's success make the noise

[sauravchandra]

Python implementation:
class FindElements:

def __init__(self, root: Optional[TreeNode]):
self.seen = set([0])
root.val = 0
self.DFS(root)

def DFS(self, node:Optional[TreeNode]):
if not node:
return

if node.left:
node.left.val = (2*node.val)+1
self.seen.add(node.left.val)
self.DFS(node.left)

if node.right:
node.right.val = (2*node.val)+2

self.DFS(node.right)

def find(self, target: int) -> bool:
if target in self.seen:
return True

return False

[Engineeringlife]

Bhaiya dp, Oops, tree ka Playlist complete karwa dijye placement challenges ra

[amanpatel]

Used Vector and Binary Search + sorting instead of Set. Complexity would be still same: storing values n + nlogn for sorting + logn for finding elements?

[lohitsalma]

SIR PLEASE MAKE VIDEOS RELATED TO BASICS OF TREE PLEASE SIR REQUEST

[YashGupta-tyhn]

Hello Bhaiya gfg Job a thon 42 ke questions pe bhi video bana do kaafi dikkat ho rhi hai samajhne me

[neelakshisachdeva]

I havent done tree yet guys and now this week is tree week. Will I be able to finish it alongside the potd problems if I start today?

[ShreyanshSrivastava-fs]

In dfs, st.clear kyu kara aapne start me find elements function me?