data_struct/LinkList(48).cpp at master · dharm4811/data_struct · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
#include<iostream>
using namespace std;
class nodes
{
	public:
	int info;
	nodes *link;

}*start;

class list
{
	public:
		list()  //constructor
		{
			start=NULL;
		}

	nodes  *create_node(int value)
	{

	nodes *temp = new nodes();			// making of new class named nodes continuosly use at every insertion of new value
    temp->info=value;
    temp->link=NULL;
    return temp; //not neccessary
    }

    void insert_beg()
    {
    	int num;
    	cout<<"enter value to the node\n";
    	cin>>num;

         nodes *temp, *p;


        if (start == NULL)

        {		 temp=create_node(num);							// only for one time run of these 'if' statement ......for puting first value

            start = temp;

            start->link = NULL;            //  neccessary because here temp and start both point node and temp already have null...check create nodes functiom

        }

        else

        {  temp=create_node(num);

            p = start;

        start=temp;

            start->link = p;

        }


	}
	   void insert_last()

    {

        int num;

        cout<<"Enter the value to be inserted: ";

        cin>>num;

         nodes *temp, *s;

        temp = create_node(num);

        s = start;

        while (s->link != NULL)

        {

            s = s->link;

        }

        temp->link = NULL;

        s->link = temp;

        cout<<"Element Inserted at last"<<endl;

    }

	void display()
	{


         nodes *temp;

        if (start == NULL)

        {

            cout<<"The List is Empty"<<endl;

            return;

        }

         temp=start;

        cout<<"Elements of list are: "<<endl;

        while (temp != NULL)

        {

            cout<<temp->info<<"->";

            temp = temp->link;

        }

        cout<<"NULL"<<endl;


	}
};
int main()
{  int ch;
	list sl;

do	{ cout<<"1.Insert at beg\t\t2.Insert at last\n3.display\t\t4.exit\n";
      cin>>ch;
      switch(ch)
      {
	  case 1:
	{

	sl.insert_beg();
     break;}
     case 2:
	sl.insert_last();
	break;
	case 3:
		sl.display();
		break;
		case 4:
			return 0;
		default:
		cout<<"\nsomething is wrong..";
		 }
}
while(true);

}