Invert Binary Tree or Mirror Tree | Tree Data Structure playlist C++ | Hello World | Leetcode

[@SurajKumar-nz7dh]

I tried it using queue and got same output. Awesome Video! Thanks a lot...

[@349_rahulbhattacharya6]

mast explanation!!Mai directly solution dekhna pda..nhi soch paya tha solution..

[@Playlist-cj9ct]

I did it, so happy that I solved it before watching video.

[@nomanraihanofficial]

Love you bro and pray from you from the bottom of my heart.. You have opened my eyes.

[@amalasebastian9968]

Great video ,thank you so much sir ,do not leave teaching!

[@HelloWorldbyprince]

Just support me I will never leave teaching

[@udaytewary3809]

Really thankyou bhaiya aapka samjhane ka tarika aisa h ki bhaut lucid way ya Asan way me samaj me aya although maine level order se socha tha ki value ko swap karu pr kaise karu samaj me nhi aa raha tha but apke stack wale solution se idea aa gya mujhe iske liye dil se dhanyawad bhaiya😍😍❤️‍🔥❤️‍🔥❤️‍🔥

[@HelloWorldbyprince]

Thanks to u for this response Please, share this channel in your college, groups, or LinkedIn bcoz it's cost nothing to you 😀

[@divyansh1391]

sb samjh aa jata hai bhaiya....

[@HelloWorldbyprince]

waoo yaar i am happy

[@tusharrastogi7490]

Just played the video and you insisted to try it on your own, and yeah.. its done. 1 like for that

[@HelloWorldbyprince]

Waooo thanks meri baat maankar question solve karne ke liye nice work

[@ashwinvarma9349]

Good to see you again😄

[@HelloWorldbyprince]

😊

[@gokulnaathb2627]

Samjh m aa rha h, bhaiya, thank you so much

[@HelloWorldbyprince]

Your welcome dear

[@priyabansal9911]

Thank you Prince for the video and hope you are fine now.

[@HelloWorldbyprince]

All good now Thanks or asking

[@nopecharon]

Your explanation is best

[@HelloWorldbyprince]

Thanks a lot 😊

[@AnkitSingh-nm5wz]

Great video...really helped me!

[@HelloWorldbyprince]

Thanks for the support 💗

[@swastikkumar9777]

Loved the way you explained.

[@HelloWorldbyprince]

Thanks a lot 😊

[@Sheer_life9980]

wow osm way..

[@HelloWorldbyprince]

Yup, thanks buddy 😊

[@codewith_me07]

Sir we can swap directly left and right then call left and right return roo

[@anonymous090]

Thank you Bhaiya, ache se samajh agya

[@HelloWorldbyprince]

Thanks yaar aise tumhara name kya hai ?

[@anonymous090]

@@HelloWorldbyprince Rashi Shukla 😄

[@Alokkumar-xu8sf]

aacha laga

[@TheStarboyVlog]

sir yeh question sayad queue se banega stack ki jagha

[@shaantyagi2187]

C++ solution: void invert(TreeNode* root){ if(root==NULL){ return; } // jaise hum log bubble sort main swap karte the ki ek temp variable bana ke usme value // rakh lete the waise hi yahan pe kar sakte hai TreeNode* left = root->left; root->left = root->right; root->right = left; invert(root->left); invert(root->right); } TreeNode* invertTree(TreeNode* root) { invert(root); return root; }

[@HelloWorldbyprince]

Amazing 😻 brother

[@masudalammolla3400]

If we use level order traversal approcah and every level before push it to the ans vector if we do reverse of the temp vector then push it

[@sohebshaikh3344]

Honestly Bhaiya maine 2 no approch socha tha vector wala aur swap wala bhi vector run bhi kiya aur samjh gya wo galat but in Swap code m baar baar error mil rha tha

[@jayanth1191]

Sir at 12:21 top must be 3 isn't it? Please explain it sir

[@rajchinagundi7498]

class Solution { public: TreeNode* invertTree(TreeNode* root) { if(root!=NULL){ swap(root->left,root->right); invertTree(root->left); invertTree(root->right); } return root; } }; I did it by this way

[@HelloWorldbyprince]

amazing bro

[@ayushnamdev6326]

bhiya full samajh aara h

[@shashwatsingh253]

Bhaiya I did by the help of Level Order Traversal class Solution { public: TreeNode* invertTree(TreeNode* root) { if(!root) return root; queue q; q.push(root); while(!q.empty()) { TreeNode* ptr = q.front(); q.pop(); if(ptr->left && !ptr->right || !ptr->left && ptr->right || ptr->left && ptr->right) { swap(ptr->left,ptr->right); } if(ptr->left) q.push(ptr->left); if(ptr->right) q.push(ptr->right); } return root; } };

[@HelloWorldbyprince]

Amazing 🤩🤩

[@NITianMonika]

Simple think about first three node baki sb recursion kar dega: 6line code in c++

[@NITianMonika]

class Solution { private: public: TreeNode* invertTree(TreeNode* root) { if(root == NULL) return root; invertTree(root->right); invertTree(root->left); swap(root->right, root->left); return root; } };

[@cr7johnChan]

//My solution for recursion if(root==NULL)return root; TreeNode*temp=root->left; root->left=root->right; root->right=temp; root->left=invertTree(root->left); root->right=invertTree(root->right); return root;

[@Hackkrosuruaatse]

Bro placement ho gyii aapki?

[@manastripathi1157]

Another approach without using stack class Solution { public: TreeNode* invertTree(TreeNode* root) { if(root==NULL) return NULL; invertTree(root->left); invertTree(root->right); swap(root->left,root->right); return root; } };

[@ramanpreetsingh5677]

Bhai, your content is amazing no one did it with stacks on YT

[@HelloWorldbyprince]

Your welcome Raman 🤠

[@AnkitKumar-ys7vs]

Stack (LIFO) can't used there, Queue(FIFO) will be used.

[@HelloWorldbyprince]

Ohh i see, and can you pls explain me how ?

[@franky1598]

bhaiya yeh approchh kaise hai class Solution { public: TreeNode* invertTree(TreeNode* root) { if(root==NULL) return NULL ; TreeNode * left = root->left ; TreeNode * right = root->right; root->left = right; root->right = left ; invertTree(root->left); invertTree(root->right); return root ; } }; vaise bhaiya mai bhi nit hamirpur se hu apse kuch guidance chaiye

[@HelloWorldbyprince]

badhiya hai bro , please we can connect on Linkedin

[@satyamsrivastava1871]

Bhaiya jab humne sara node me store krawaya toh v root me kaise change hau?

[@BAkashAnand]

Recursive Solution: TreeNode* invertTree(TreeNode* root) { if(root!=NULL){ swap(root->left,root->right); invertTree(root->left); invertTree(root->right); } return root; }

[@askshivansh]

Bhaiya, mai address ko swap kr rha hu, ye solution bhi valid hai na?

[@HelloWorldbyprince]

yup

[@nitinchauhan_18]

Using Stack but doing FIFO

[@HelloWorldbyprince]

Stack is LIFO

[@memefulland7140]

Done using link swaping Code: TreeNode* invertTree(TreeNode* root) { if(!root) return root; TreeNode* nl=root->left; TreeNode* nr=root->right; root->left=nr; root->right=nl; invertTree(root->left); invertTree(root->right); return root; }

[@HelloWorldbyprince]

Yeaaahhhh 🔥🔥🔥🔥🔥

[@R_yuk-xd]

sorry but agar stack se pop krenge to last element phle pop hoga shayad.

[@HelloWorldbyprince]

Yesss u r right buddy

[@mayankchoudhary7937]

it doesn't matter in what it pops.. it was trick to explain i guess, try push in stack in reverse order like right first then left and dry run it..

[@SanjaySingh-qf4tk]

if(root==NULL){ return root; } invertTree(root->left); invertTree(root->right); if(root->left!=NULL|| root->right!=NULL){ swap(root->left,root->right); } return root;

[@gauravnavinchandrabadgujar4057]

if(!st.empty()) ki jagah while poop aaegi. typo mistake.

[@HelloWorldbyprince]

Thanks buddy