leonmavr

int count_spaces (FILE* f) {
        int spaces = 0;
        char chIn;
  
        for ( chIn = '\0'; chIn != '\n'; spaces +=  ( chIn = fgetc(f) ) == ' '   );
        return spaces;
}

leonmavr

/*
	takes the root of the tree, a new node
	where the last parent will be written to,
	a counter passed as 0, and max = inf
	
	The recursions can be unwrapped in the 
	following pseudocode, based on Depth 
	First Search

	visited = {}