OopLabs/Stack.cpp at master · Rayyan98/OopLabs · 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
#include <iostream>

using namespace std;

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

class Stack
{
private:

	Node* head;
	int length;

public:
	Stack()
	{
		head = NULL;
		length=0;
	}

	~Stack()
	{

	}

	void Push(int val)
	{
		if(head == NULL)
		{
			head = new Node;
			head->value = val;
			head->next = NULL;
		}
		else
		{
			Node* temp = head;
			head = new Node;
			head->value = val;
			head->next=temp;
		}
		length += 1;
	}

	int Pop()
	{
		if(head != NULL)
		{
			Node* temp = head->next;
			int a=head->value;
			delete head;
			head = temp;
			length -= 1;
			return a;
		}
		return -1;
	}

	int Top()
	{
		if(head != NULL)
		{
		return head->value;
		}
		return -1;
	}

	int Getlength()
	{
		return length;
	}

	bool Isempty()
	{
		if(head == NULL)
		{
			return false;
		}
		else return true;
	}

	int Bottom(){
		if(head == NULL)
		{
			return -1;
		}

		Node* temp = head;
		while(temp->next != NULL)
		{
			temp = temp->next;
		}
		return temp->value;
	}
};


int main()
{
	Stack s;
	cout << s.Isempty() <<endl;
	s.Push(5);
	cout << s.Isempty() <<endl;
	cout<<	s.Top()<<endl;
	s.Push(6);
	s.Push(87);
	s.Push(98);
	cout << s.Getlength() <<endl;
	cout << s.Bottom() << endl;
	cout<<	s.Top()<<endl;
	s.Pop();
	cout<<	s.Top()<<endl;
	s.Pop();
	cout<<	s.Pop()<<endl;
	cout<< s.Top()<<endl;
	cout << s.Isempty() << endl;
	s.Pop();
	cout << s.Isempty()<<endl;
	cout << s.Top()<<endl;
	return 0;
}