• 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

The Magic HackerEarth Nirvana solutions Hiring Challenge

Test Cases for Round Function

Mirror of Tree

Templates in C++

Reversal of LinkedList

Find shortest distances between every pair of vertices ( Dynamic Programming Floyd Warshall Algorithm)

Level order traversal in Spiral form

Urban Ladder Written Test.

K’th Largest Element in BST when modification to BST is not allowed

Best Java Book | Top Java Programming Book for Beginners

How Radix sort works

Subset Sum Problem Dynamic programming

Trie Dictionary

CodeChef’ RRCOPY

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

Sort an array according to the order defined by another array

Maximum difference between two elements s.t larger element appears after the smaller number

Binary Tree Isomorphic to each other

Print Power Set of a Set

Wrong Directions given find minimum moves so that he can reach to the destination

Convert Decimal to Roman numbers / Romanizer HackerEarth Code

Linked List V/S Binary Search Tree

SAP Off Campus Hiring_ March 2015 Sample Questions

Implement a generic binary search algorithm for Integer Double String etc

N Petrol bunks or City arranged in circle. You have Fuel and distance between petrol bunks. Is it possible to find starting point so that we can travel all Petrol Bunks

Trapping Rain Water

TicTacToe Game As Asked in Flipkart

Adobe Interview Questions 8 month Exp

Skiing on Mountains Matrix

Reverse a Linked List in groups of given size

Copyright © 2026 · Genesis Framework · WordPress · Log in