Stacks using LL

[Suraj-Ajjampur]

Structure

struct Node{
int data;
struct Node *next;
}

Empty Condition

If Top points to NULL

Full Condition

If heap is full i.e if malloc fails and assigned pointer is NULL

Push Inserting an element in the stack

• Check for full condition
• copy the value
• create the link from new node to the current top
• move top pointer to new top

void push(int x)
{
Node *t =(struct Node*)malloc(sizeof(struct Node));
if(t == NULL)
     printf("Stack Overflow");
else
{
t->data=x;
t->next=top;
top=t;
}
}

Pop

• Check for empty condition
• Assign top to temp pointer
• Copy the data
• top=top->next;
• free(p);

int pop()
{
struct Node *t;
  int x=-1;
  if(top==NULL)
    printf("Stack is Empty\n");
  else
  {
    t=top;
    top=top->next;
    x=t->data;
    free(t);
  }
  return x;
}

[Suraj-Ajjampur]

Initial code in commit https://github.com/Suraj-Ajjampur/DSA/commit/6c471508c62f5f0a0b9651202f05ef75eb407e79