Tilt of Binary Tree - Question | Binary Trees | Data Structure and Algorithms in JAVA

[@ayushgoel9584]

Sir ye acha Kia aapne, trees beech mein pending reh gya tha, ab poora ho jaega,thank you

[@Pepcoding]

cool is brri miss mt krna lekin

[@shubhangi-misra]

Thank you sir!

[@Pepcoding]

You are welcome!

[@rupeshsharma9235]

thanku sir

[@wecan2729]

correct code in c++
int find(Node* root,int &ans)
{
if(!root)
{
return 0;
}
int l=find(root->left,ans);
int r=find(root->right,ans);
ans=ans+abs(l-r);
return l+r+root->data;
}
int tiltTree(Node *root)
{
int ans=0;
find(root,ans);
return ans;
}

[@Pepcoding]

For better insights, visit nados.pepcoding.com, post your doubts, community will help you out there.