StackLL.cpp

#include "StackLL.h"


class Stack::Node //self-referential Node class
{
	public:
	   int data = 0;
	   Node* link = nullptr;
	   //link is a data member which is a pointer 
	   //to an object of the same type (i.e. Node)
	
	};

Stack::~Stack()
{
	
	clear();
	}

int Stack::size()
{
	return num_elements;
	
	
	}

void Stack::push(int val)

{
	
	
	Node* newPtr = new Node{val};
	
	  newPtr->link = frontPtr;
	  frontPtr = newPtr;

     num_elements++;	
	
	
	}

void Stack::pop(){
	
	
	  Node* delPtr = frontPtr;
	  frontPtr = frontPtr->link;
	  
	  delete delPtr;
	num_elements--;
	}

int Stack::top(){
	
	return frontPtr->data;
}

void Stack::clear(){
	
	while(num_elements > 0)
      pop();
	
	}