Mumbai University > Information Technology > Sem 3 > Data Structure and Algorithm analysis

Marks: 10 M

Year: May 2015

Program:

#include<iostream>
#include<conio.h>
using namespace std;
class Stack
{
    int stk[10];
    int top;
    public:
    Stack()
    {
    top=-1; 
    }

//This funtion is used to push an elemnt into stack
    void push(int x)
    {
        if(isFull())
        {
            cout <<"Stack is full";
            return;
        }
        top++;
        stk[top]=x;
        cout <<"Inserted Element:"<<" "<<x;
    }

    //This functionn is …