int push(stack_header* stack, int n) { stack_node *new_top = new_stack_node(n); if(new_top == NULL) return 0; if(stack_is_null(stack)) { stack->top = new_top; } else { new_top->next = stack->top; stack->top = new_top; } stack->size++; return 1; }
void stack_push (struct stack_node **L, stack_data_type X) { struct stack_node *p = new_stack_node (); p->next = *L; p->X = X; *L = p; }