A03/match_braces.c
// Pop the top node from a stack (implemented as a linked list) and frees it
// Param top: the top node of the current stack (NULL if empty)
// Returns the new top of the stack
Pop the top node from a stack (implemented as a linked list) and frees it
Param top: the top node of the current stack (NULL if empty)
Returns the new top of the stack
Pop the top node from a stack ( implemented as a linked list ) and frees it Param top : the top node of the current stack ( NULL if empty ) Returns the new top of the stack
struct node* pop(struct node* top) {
	struct node* placer = top;
	if (top == NULL) {
		return NULL;
	}
	placer = top;
	top = top->next;
	free(placer);
	return top;
}
struct node * pop ( struct node * top ) { struct node * placer = top ; if ( top == NULL ) { return NULL ; } placer = top ; top = top -> next ; free ( placer ) ; return top ; }
Pop the top node from a stack (implemented as a linked list) and frees it
Param top: the top node of the current stack (NULL if empty)
Returns the new top of the stack
Pop the top node from a stack ( implemented as a linked list ) and frees it Param top : the top node of the current stack ( NULL if empty ) Returns the new top of the stack