Do you see any problem in the code of nextInOrder below: TreeNode * nextInorder(TreeNode * p)

{

if(p->RTH == thread)

return( p->R );

else {

p = p->R;

while(p->LTH == child)

p = p->R;

return p;

}

}

► The function has no problem and will fulfill the purpose successfully.

► The function cannot be compile as it has a syntax error.

► The function has a logical problem, therefore, it will not work properly.

► The function will be compiled but will throw runtime exception immediately after the control is transferred to this function.