Two testcase are not passing

#1
#2

hello @gargshivam2001

your build tree function will work only for complete. tree only.

do a level order traversal and build tree using that.

node *buildtree() //build tree function to build tree level wise
{
int d;
cin>>d;
queue<node *>q;
node  * root=new node(d);
q.push(root);
int c1,c2;
while(!q.empty())
{
node*  f=q.front();
q.pop();
cin>>c1>>c2;
if(c1!=-1)
{
f->left=new node(c1);
q.push(f->left);
}
if(c2!=-1)
{
f->right=new node(c2);
q.push(f->right);
}
}
return root;
}
#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.