Create a gist now

Instantly share code, notes, and snippets.

What would you like to do?
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

This comment has been minimized.

Show comment Hide comment
@nityan

nityan Mar 21, 2014

You have infinite recursion

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