• Skip to primary navigation
  • Skip to content
  • Skip to primary sidebar
  • Skip to secondary sidebar

GoHired

Interview Questions asked in Google, Microsoft, Amazon

Join WeekEnd Online Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

  • Home
  • Best Java Books
  • Algorithm
  • Internship
  • Certificates
  • About Us
  • Contact Us
  • Privacy Policy
  • Array
  • Stack
  • Queue
  • LinkedList
  • DP
  • Strings
  • Tree
  • Mathametical
  • Puzzles
  • Graph

Generic Object Oriented Stack with Template

April 27, 2015 by Dhaval Dave

Here We have implemented a Generic Stack Example with Templates in C++ where we can Push any element into stack.

#include <iostream>
#include <vector>
#include <cstdlib>
#include <string>
#include <stdexcept>
using namespace std;

template <class T>
class Stack { 
  private: 
  vector<T> element; // elements
public: 
  void push(T const&); // push element 
  void pop(); // pop element 
  T top() const; // return top element 
  bool empty() const{ // return true if empty.
  return element.empty(); 
  } 
};
template <class T> void Stack<T>::push (T const& item) { 
 element.push_back(item); 
}
template <class T>
void Stack<T>::pop () { 
  if (element.empty()) { 
  throw out_of_range("Stack<>::pop(): empty stack"); 
  }
 element.pop_back(); 
}
template <class T> T Stack<T>::top () const 
{ 
  if (element.empty()) { 
  throw out_of_range("Stack<>::top(): empty stack"); 
  }
 return element.back(); 
}
int main() 
{ 
 try { 
  Stack<int> myIntegerStack; // stack of ints 
  Stack<string> myStringStack; // stack of strings
  myIntegerStack.push(10); 
       cout << myIntegerStack.top() <<endl;

myStringStack.push(“Messi”);
cout << myStringStack.top() << std::endl;
}
catch (exception const& ex) {
cerr << “Exception: ” << ex.what() <<endl;
return -1;
}
}
See Working Code at http://ideone.com/8sfDfC

Similar Articles

Filed Under: Adobe Interview Questions, Flipkart Interview Questions, Interview Questions, problem Tagged With: Stack

Reader Interactions

Primary Sidebar

Join WeekEnd Online/Offline Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

Join WeekEnd Online/Offline Batch from 4-April-2020

WhatsApp us

Secondary Sidebar

Custom Search

  • How I cracked AMAZON
  • LeetCode
  • Adobe
  • Amazon
  • Facebook
  • Microsoft
  • Hacker Earth
  • CSE Interview

Top Rated Questions

VMWare Openings

Skiing on Mountains Matrix

Find Nearest Minimum number in left side in O(n)

simple sql injection

Urban Ladder Written Test.

Memory Efficient LinkedList

Walmart Labs Interview Experience

‘N’ Story Building, with 1,2,3 steps how many ways can a person reach top of building.

Count number of ways to reach a given score in a game

Flipkart SDET Interview Experience

Find two non repeating elements in an array of repeating elements

Search element in a matrix with all rows and columns in sorted order

Rectangular chocolate bar Create at least one piece which consists of exactly nTiles tiles

ADOBE Aptitude C Language Test

Find and print longest consecutive number sequence in a given sequence in O(n)

Templates in C++

Client Server C program

Find loop in Singly linked list

Level order traversal in Spiral form

BlueStone E-commerce Interview Experience

Possible sizes of bus to carry n groups of friends

Handle duplicates in Binary Search Tree

Max Sum in circularly situated Values

SAP Off Campus Hiring_ March 2015 Sample Questions

DFS (Depth First Search)

Find Pythagorean Triplets in an array in O(N)

Python Array String

C Program for TAIL command of UNIX

Given array of 0’s and 1’s. All 0’s are coming first followed by 1’s. find the position of first 1

robot standing at first cell of an M*N matrix. It can move only in two directions, right and down. In how many ways, it can reach to the last cell i.e. (M, N) Code it

Copyright © 2026 · Genesis Framework · WordPress · Log in