CareerCup

suppose i write the code


int main()
{
int i=-1, j=2, k=0, m;
m = ++i && ++j || ++k;
printf ("%d %d %d %d", i,j,k,m);
return 0;
}

the output shows:
0 2 1 1
shouldnt it show
0 2 0 0
how does the operation takes place in this?

suppose i write the code


int main()
{
int i=-1, j=2, k=0, m;
m = ++i && ++j || ++k;
printf ("%d %d %d %d", i,j,k,m);
return 0;
}

the output shows:
0 2 1 1
shouldnt it show
0 2 0 0
how does the operation takes place in this?

but this approach without any preorder/postorder traversal, the tree formed eikk not be a balanced. rather it will be a right oriented subtree where each node with be right child of its parent