Notes

#include<iostream>
#include<assert.h>
using namespace std ;
const int maxsize=200;
int a;
template <class SET>
class Stack{
public :
Stack();
void push(const SET& item);
SET pop();
bool isempty();
private :
SET sa[maxsize];
int topindex ;
};
template <class SET>
Stack<SET>::Stack()
{
topindex=-1;
}
template <class SET>
void Stack<SET>::push(const SET& item)
{
topindex ++;
if(topindex < maxsize);

sa[topindex]=item;

}
template <class SET>
SET Stack<SET>::pop()
{
if (topindex >=0) ;
{
int a = topindex;
topindex-- ;

return sa[a];
}

}
template <class SET>
bool Stack<SET>::isempty()
{
return topindex==-1;
}
void main ()
{
Stack<int > s,t;
int x;
cout<<"enter the number in dec "<<endl;
cin>>x;

while(x>=1)
{

if(x<2)
{

s.push(1);

}
else
{

s.push(x%2);
}
x=x/2;
}

cout<< " the number in binary"<<endl;
while(!s.isempty())
{
cout<<s.pop();
}

cout<<endl;

}