Can anybody tell me why its giving RUNTIME ERROR


#1

int InOrder(TreeNodeA, int &B){
if(!A)return -1;
int l= InOrder(A->left,B);
cout<<B<< " " << l << " " <<
if(B==0)return l;
B–;
if(B==0)return A->val;
InOrder(A->right,B );
}
int Solution::kthsmallest(TreeNode
A, int B) {
return InOrder(A,B);
}