Hacktoberfest-For-Competitive-Programming/LinkedListStack.cpp at main · TamilClasher/Hacktoberfest-For-Competitive-Programming · 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
#include<iostream>

using namespace std;

class node
{
  public:
  int data;
  node* next;
};

void print(node* n,node* tail)
{
  while(n->next!=tail)
  {
    cout<<n->data<<" ";
    n = n->next;
  }
  cout<<"\n";
}

node* pushfront(node *n,int data)
{
  if(n == NULL)
  {
    node* new_node= new node();
    new_node->data = data;
    new_node->next = NULL;
    return new_node;
  }
  else
  {
    node* new_node= new node();
    new_node->data = data;
    new_node->next = n;
    return new_node;
  }
}

node* pushlast(node *n,int data)
{
  if(n == NULL)
  {
    cout<<"Nothing in the list.Try Pushing in the front\n";
    return 0;
  }
  else
  {
    node* new_node= new node();
    n->next = new_node;
    new_node->data = data;
    new_node->next = NULL;
    return new_node;
  }
}

node* poplast(node* n)
{
  if(n == NULL)
  {
    cout<<"Nothing in the list.Try Pushing in the front\n";
    return 0;
  }
  else
  {
    node* temp = n->next;
    n->next = NULL;
    delete(temp);
    return n;
  }
}

int main()
{
  node* head = NULL;
  node* tail = head;
  head = pushfront(head,5);
  tail = pushlast(head,3);
  tail = pushlast(tail,8);
  tail = pushlast(tail,9);
  tail = poplast(tail);
  tail = poplast(tail);
  print(head,tail);
}