Mirror of a Tree | Love Babbar DSA Sheet | Amazon | Microsoft | Paytm 🔥 | GFG | Leetcode

[@prasannapm3220]

good

[@prasannapm3220]

how is this different from invert tree question and mirror tree ?

[@lone_wolf7721]

Here I get error in my code!! 🥺
It's about include related and file related error

[@anjandey6089]

void mirror(Node* node)
{
// code here
if(node== NULL)
return ;
mirror(node->left);
mirror(node->right);
//exchange(node->left,node->right);
Node* temp=node->left;
node-> left=node-> right;
node-> right=temp;
}

[@muskanchoudhary9792]

make sure you have selected CPP

[@lone_wolf7721]

@@muskanchoudhary9792 yeah

[@owaisch3442]

It is a post-order traversal, right?

[@giit85]

But swapping is expensive operation can we avoid and think other approach????

[@mukeshkumar-hy7yc]

Node* Mirror(Node*root){
Node*p,*q;
if(root!=NULL){
p=Mirror(root->lchild);
q=Mirror(root->rchild);
root->rchild=p;
root->lchild=q;
return root;
}
return NULL;
}
use this fun you will get best time complexity

[@cartube6219]

Yogesh bhaiya se video banaya karo yrr , apko toh java aati nhi

[@deepanshukumar7290]

array playist not completed

[@CodeLibrary]

We are trying to solve imp questions first and after that we will be solving rest of the questions.

[@mohammadhiraashrafi9448]

allah app ko salamat rakhe

[@ayushjain386]

bhai dsa basic krne ke baad phele is list ke question kre ya phele competitive programming

[@CodeLibrary]

If you have done basics of DSA then start with sheet first, this will sharpen your dsa skills more

[@CodeLibrary]

After solving some questions if you are comfortable with this type of questions then start CP parallaly with sheet

[@ayushjain386]

@@CodeLibrary ok brother

[@purnaanrup2394]

Bro insta link

[@CodeLibrary]

Insta link-- instagram.com/i_am_yogesh_here/