Huffman-Code-Tree/Stack.cpp at master · andrewrigas/Huffman-Code-Tree · 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
#include<iostream>
#include<string>
#include"stack.h"

using namespace std;

void stack::push(string d)
{

	stack* temp = new stack;

	temp->data = d;
	temp->next = NULL;

	if(top==NULL)
	{
		top=temp;
	}
	else
	{
		temp->next=top;
		top=temp;
	}

}

string stack::pop()
{

	if(top==NULL)
	{
		string p="Empty linkedstack !\n";
		return p;
	}
	else if(top->next==NULL)
	{
		stack *temp=top;
		top=NULL;
		return temp->data;
		delete temp;
	}
	else
	{
		stack *temp=top;
		top=top->next;
		return temp->data;
		delete temp;
	}


}

string stack::peek(){

	if(top==NULL)
	{
		cout<<"Empty linkedstack !\n";
	}
	else
	{

		return top->data;

	}

}

bool stack::isEmpty(){

	if(top==NULL)
	{
		return true;
	}
	else
	{
		return false;
	}
}

string stack::getCode(int x)
{
	stack *curr=top;
	for(int i=0;i<x;i++)
	{
		curr=curr->next;
	}
	return curr->data;
}