Vertical order print of binary tree

#1


whats wrong in this code

#2

Hey
if(c1!=1){

        temp->left=new node(c1);

        q.push(temp->left);

    }

    if(c2!=1){

        temp->right=new node(c2);

        q.push(temp->right);

    }

Here conditions should be c1!=-1 & c2 !=-1
i.e
if(c1!=-1){

        temp->left=new node(c1);

        q.push(temp->left);

    }

    if(c2!=-1){

        temp->right=new node(c2);

        q.push(temp->right);

    }
#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.