DataStructuresPracticeCodes/classtreeheader.h at master · Roshan13046/DataStructuresPracticeCodes · 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
class node
{
 public :
   		node *lchild,*rchild;
   		int data;
};

//faulty program
class stack_node
{
  public:
         node* data1;
         stack_node * next;

};


class stack
{

  public:
   stack_node *top;

  public:

  	stack()
  	{
  		top=0;
	}

    void push(node * x)
    {

    	stack_node *t =new stack_node ;
    	if(t== 0)
    	{
    		cout<<"stack overflow";
		}
		else
		{
			t->data1 = x;
			t->next=top;
			top=t;
		}
	}

	node * pop()
	{
		node *p,*q;

		if(top == 0 )
		{
			cout<<"Empty stack";
		}
		else
		{
			p=top->data1;
			top=top->next;
			q=p;
			delete(p);
		}
		return q;
	}


};


class queue
{
	private:
			node **qdata;
			int size,front,rear;
	public:
			queue(int size)
			{
				this->size=size;
				front=rear=0;
				qdata=new node*[size];
			}

			void enqueue(node*);
			node* dequeue();
			int isempty();
};


void queue::enqueue(node* x)
{

   if((rear+1)%size == front	)
   	{
   		cout<<"queue is full\n";
    }
    else
    {
    	rear=(rear+1)%size;
    	qdata[rear]=x;
	}
}


//delete function
node* queue::dequeue()
{
    node *x=0 ;
	if(front == rear)
	{
		cout<<" queue is empty can't be deleted\n";
	}
    else
    {
    	front=(front+1)%size;
    	x=qdata[front];
	}
	return x ;
}


//isempty
int queue::isempty()
{
	return(front == rear);
}