C / C++ / MFC

#include <stdio.h>

struct Element{
	int value;
	struct Element *next;
};

struct Stack{
	int length;
	struct Element *head;
};

struct Stack createStack(){
	struct Stack s;
	s.length = 0;
	s.head = NULL;
	return s;
}


void push(struct Stack *stack, int value){
	if (stack->head == NULL){
		struct Element e = {value, NULL};
		stack->head = &e;
	}
	else{
		struct Element e = {value, stack->head};
		stack->head = &e;
		printf("(%d,%d)", stack->head->value, stack->head->next->value);
		if (stack->head == stack->head->next)
			printf("same");
	}

	stack->length++;
}

int main(){
	struct Stack s = createStack();
	int i;
	for (i = 0; i < 10; i++)
		push(&s, i);
	return 0;
}

struct Element e = {value, stack->head};<br />
		stack->head = &e;

#include <iostream>
using namespace std;

class Element{

public:
	int value;
	Element *next;

	Element() : value(0), next(NULL) {}
	Element(int v) : value(v), next(NULL) {}
	Element(int v,Element *n) : value(v), next(n) {}
};

class Stack{

private:
	int length;
	Element head;

public:
	Stack() : head(), length(0) {}

	void clear();
	void traversal() const;
	void push(int value);
	int pop();
};


void Stack::clear(){
	head = Element();
}

void Stack::traversal() const{
	if (length == 0)
		cout << "The stack is empty" << endl;
	else{
		Element e = head;
		while(true){
			cout << e.value << ' ';
			if (e.next != NULL)
				e = *e.next;
			else
				break;
		}
	}
}
void Stack::push(int value){
	if (length == 0)
		head = Element(value);
	else
		head = Element(value,&head);

	length++;
}

int Stack::pop(){
	return 0;
}




int main(int argc, string args[]){
	Stack s;
	
	cout << endl;

	for (int i = 0; i < 10; i++)
		s.push(i);
	s.traversal();

	cout << endl;

	return 0;
}