Create a gist now

Instantly share code, notes, and snippets.

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;}
}
@nityan

You have infinite recursion

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment