public
Created

  • Download Gist
gistfile1.txt
1 2 3 4 5 6 7 8 9 10 11 12
int bstNode<Item>::increment(int count)
{
increment(count);
if (left_field)
count= left_field->size()+1;
else
{ return 0;}
if (right_field)
count= left_field->size()+1;
else
{ return 0;}
}

You have infinite recursion

Please sign in to comment on this gist.

Something went wrong with that request. Please try again.