Data-Structure/LinkedList.cpp at main · AsaHero/Data-Structure · 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
#include <iostream>

using namespace std;


	class Node
	{
	public:
		int info;
		Node *next;
	};

class List
{
private:
	Node* head;


public:

	List()
	{
		this->head = NULL;
	}
	~List(){}

	bool isEmpty()
	{
		return head == NULL;
	}


	void push_front(int info)
	{
		Node *temp = new Node;
		temp->info = info;

		if (head == NULL)
		{
			temp->next = NULL;
			head = temp;
		}
		else
		{
			temp->next = head;
			head = temp;
		}
	}
	void push_back(int info)
	{
		Node* temp = new Node;
		temp->info = info;
		temp->next = NULL;
		if(head == NULL)
		{
			temp->next = NULL;
			head = temp;
		}
		else
		{
			Node *cur = new Node;
			cur = head;
			while(cur->next != NULL)
			{
				cur = cur->next;
			}

			cur->next = temp;
		}
	}
	void pop_front()
	{
		if(head == NULL)
		{
			cout << "Underflow!: no element to pop" << endl;
		}
		else
			head = head->next;
	}

	void pop_back()
	{
		if(head == NULL)
		{
			cout << "Underflow !: no element to pop" << endl;
		}
		else
		{
			Node *temp = new Node();
			temp = head;
			while(temp->next->next == NULL)
			{
				temp = temp->next;
			}

			temp = temp->next->next;
		}

	}
	int get_value(int index)
	{
		Node *node= new Node();
		node = head;
		for (int i = 0; i < index; ++i)
		{
			node = node->next;
		}

		return node->info;
	}

	void pop_element(int index)
	{
		Node* start = new Node();

	}

};

int main()
{
	List *list = new List();

	list->push_front(5);
	list->push_front(15);
	list->push_front(20);


	cout << list->get_value(1) << endl;

	return 0;
}