Single_Linked_List.cpp

#include<iostream>
using namespace std;

//Structure
struct node{
	int data;
	node* next;
}; 
//Class
class LinkedList{
	private:
		node* head;
//Constructor
	public:
		LinkedList(){
			head= NULL;
		}
void AddBeg(int val){
	node* curr = new node;
	curr->data = val;
	curr->next = head;
	head = curr;
	return;
}
/*void AddEnd(int val){
	node* curr = new node          ;
	curr->data = val;
	curr->next = NULL;
	if(head==NULL){
		head = curr;
	//	curr->data = val;
		return;
	}
	node* temp = head;
	while(temp->next!=NULL){
		temp = temp->next;
		}
		
	//	temp->next = curr;
	
}*/
void Display(){
	if(head==NULL){
		cout<<"Linked List is Empty!!!"<<endl;
		return;
		}
		node* temp =head;
		while(temp!=NULL){
		cout<<temp->data<<endl;
		temp= temp->next;
		}
		//return;
}
};
int main (){
	LinkedList l;
	int choice,val,pos;
	while(1){
		cout<<"Linked List Menu"<<endl;
		cout<<"1.Add First"<<endl;
		cout<<"5.Display"<<endl;
		cout<<"Enter your choice"<<endl;
		cin>>choice;
	switch(choice){
		case 1:
			cout<<"Enter a value:"<<endl;
			cin>>val;
			l.AddBeg(val);
			break;
	/*	case 2:
			cout<<"Enter a value:"<<endl;
			cin>>val;
			l.AddEnd(val);
			break;	*/		
		case 5:
			l.Display();
			break;
		default:
			cout<<"Invalid Choice.Try Again"<<endl;
				}
	}
	return 0;
}