Skip to content
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
nityan commented Mar 21, 2014

You have infinite recursion

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Something went wrong with that request. Please try again.