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

This is the video under the series of DATA STRUCTURE & ALGORITHM in a TREE Playlist. We are going to understand How to create Invert Binary Tree or Mirror Tree.
Join My Telegram channel for more Updates: telegram.me/he...
complete DSA preparation: github.com/Pri...
► 226. Invert Binary Tree || Mirror Tree
Given the root of a binary tree, invert the tree, and return its root.
Input:
1
/ \
2 3
Output: 2 1 3
Explanation: The tree is
1 (mirror) 1
/ \ = / \
3 2 2 3
The inorder of mirrors is 2 1 3
We also Provide courses on Competitive Programming and Data structure and Algorithms. Please see our Full Playlist on our Channel.
----------------------------------------------------------------------------------------:
Invert Binary Tree: leetcode.com/p...
code in This Video: github.com/Pri...
----------------------------------------------------------------------------------------
** Unacademy
Use my code "HELLOWORLD" to get 10% discount
Career as a Developer: unacademy.com/...
Top interview questions: bit.ly/Unacade...
----------------------------------------------------------------------------------------
*Follow me *
LinkedIn► / iamprince
Facebook► / helloworldofficials
Instagram► / helloworldbyprince
Twitter► / prince_king_
Telegram► telegram.me/he...
----------------------------------------------------------------------------------------
►Our Playlists on:-
► Tree: • Tree Data Structure & ...
► Hashing: • Hashing Data Structure...
► Matrix: • Matrix (Multidimension...
► STL: • Standard Template Libr...
► Leetcode: • LeetCode Solutions And...
►Competitive Programming: • Full course in Competi...
►C++ Full Course : • C++ full Course in HINDI
►Algorithms: • L-01 || Prefix Sum Arr...
►Data Structure: • Data Structures with C...
------------------------------------------------------------------------
🌟 Please leave a LIKE ❤️ and SUBSCRIBE for more AMAZING content! 🌟
✨ Tags ✨
Invert Binary Tree
Mirror Tree
The tree Data structure in Hindi
Find the Invert of a Binary Tree
Use of Tree Data structure in real Life
question asked in Google
off-campus placement
how to learn to code for beginners
Practice Tree data structure
tree in data structure
Best Telegram channel for Off-campus Placement drive
Tree in a data structure in Hindi
Tree Full playlist for Beginners
#Tree #Leetcode #programming

[@349_rahulbhattacharya6]

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

[@SurajKumar-nz7dh]

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

[@Playlist-cj9ct]

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

[@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 😀

[@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

[@divyansh1391]

sb samjh aa jata hai bhaiya....

[@HelloWorldbyprince]

waoo yaar i am happy

[@amalasebastian9968]

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

[@HelloWorldbyprince]

Just support me I will never leave teaching

[@gokulnaathb2627]

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

[@HelloWorldbyprince]

Your welcome dear

[@ashwinvarma9349]

Good to see you again😄

[@HelloWorldbyprince]

😊

[@nopecharon]

Your explanation is best

[@HelloWorldbyprince]

Thanks a lot 😊

[@priyabansal9911]

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

[@HelloWorldbyprince]

All good now Thanks or asking

[@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

[@anonymous090]

Thank you Bhaiya, ache se samajh agya

[@HelloWorldbyprince]

Thanks yaar aise tumhara name kya hai ?

[@anonymous090]

@@HelloWorldbyprince Rashi Shukla 😄

[@codewith_me07]

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

[@Alokkumar-xu8sf]

aacha laga

[@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 🔥🔥🔥🔥🔥

[@swastikkumar9777]

Loved the way you explained.

[@HelloWorldbyprince]

Thanks a lot 😊

[@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

[@AnkitSingh-nm5wz]

Great video...really helped me!

[@HelloWorldbyprince]

Thanks for the support 💗

[@Sheer_life9980]

wow osm way..

[@HelloWorldbyprince]

Yup, thanks buddy 😊

[@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; } };

[@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?

[@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

[@TheStarboyVlog]

sir yeh question sayad queue se banega stack ki jagha

[@BAkashAnand]

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

[@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 🤩🤩

[@ayushnamdev6326]

bhiya full samajh aara h

[@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

[@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;

[@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; } };

[@AnkitKumar-ys7vs]

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

[@HelloWorldbyprince]

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

[@jayanth1191]

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

[@satyamsrivastava1871]

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

[@ramanpreetsingh5677]

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

[@HelloWorldbyprince]

Your welcome Raman 🤠

[@nitinchauhan_18]

Using Stack but doing FIFO

[@HelloWorldbyprince]

Stack is LIFO

[@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..

[@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

[@gauravnavinchandrabadgujar4057]

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

[@HelloWorldbyprince]

Thanks buddy

[@askshivansh]

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

[@HelloWorldbyprince]

yup