#include <stdio.h>
#include <stdlib.h>

struct Node
{
	int data;
	struct Node* next;
}*head = NULL;


struct Node* addNode(struct Node* head, int data)
{
	struct Node* n = (struct Node*)malloc(sizeof(struct Node));
	n->data = data;
	n->next = head;
	head = n;
	return n;//return new head
}

void removeNode(struct Node* el)
{
	struct Node* t;
	if (el == head){
		t = head;
		head = head->next;
		free(t);
	}
	else{
		for (struct Node* prev = head; prev->next; prev = prev->next){
			if (prev->next == el){
				t = prev->next;
				prev->next = prev->next->next;
				free(t);
				break;
			}
		}
	}
}

void removeNode2(struct Node* el) //Anatoly Moskovsky 06.05.2015
{
	for (struct Node** cur = &head; *cur; cur = &(*cur)->next) {
		if (*cur == el){
			*cur = el->next;
			free(el);
			break;
		}
	}
}


struct Node* get_pointer(int n)
{
	struct Node* res = head;
	for (int i = 0; i < n; ++i){
		res = res->next;
	}
	return res;
}

void view_Nodes()
{
	printf("\n");
	for (struct Node* cur = head; cur; cur = cur->next)
	{
		printf("%i ", cur->data);
	}
}

int main()
{
	int choice, t;
	do{
		printf("\nprint your choice: ");
		scanf("%i", &choice);
		switch (choice)
		{
		case 1:
			printf("\ndata: ");
			scanf("%i", &t);
			head = addNode(head, t);
			break;
		case 2:
			printf("\nremove el whith n: ");
			scanf("%i", &t);
			removeNode2(get_pointer(t));
			break;
		case 3:
			view_Nodes();
			break;
		case 4:
			break;
		}
	} while (choice != 4);
	return 0;
}