Paste code

#include <iostream>

using namespace std ;

class lifo
{
 struct Node
 {
  int c ;
  Node *p ;
 };
 Node* top ;
public:
 lifo () ;
 //~lifo () ;
 void add ( int ) ;
 void print () ;
 //void remove () ;
 Node * find ( int ) ;
} ;

lifo::lifo() 
{
 top = 0 ;
}

void lifo::add( int cell )
{
 Node *prev = new Node ;
 prev->c  = cell ;
 prev->p = top ;
 top = prev ;
}

void lifo::print()
{
 Node *prev = top ;
 while ( prev )
 {
  cout << prev->c ;
  prev = prev ->p ;
  top = prev ;
 }
}

Node * lifo::find ( int key )
{
 Node *prev = top ;
 while ( prev )
 {
  if ( prev->c == key )
   break ;
  prev = prev->p ;

 }
 return prev ;
}

/*void lifo::remove ()
{
 Node *prev1 = new Node ;
 Node *prev = top ;


}*/
int main ()
{
 int cell ;
 lifo stack ;
 for ( int i = 0 ; i<3 ; i++ )
 {
  cin >> cell ;
  stack.add ( cell ) ;
 }
 stack.print ( ) ;
 system &#40; "Pause" &#41; ;
 return 0 ;
}