• 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

Find next greater number with same set of digits

SAP Interview Questions

LeetCode: Binary Tree Maximum Path Sum

Implement a generic binary search algorithm for Integer Double String etc

Practo Hiring Experience

Convert Decimal to Roman numbers / Romanizer HackerEarth Code

Find the element that appears once others appears thrice

Possible sizes of bus to carry n groups of friends

Subset Sum Problem Dynamic programming

Find min element in Sorted Rotated Array (Without Duplicates)

Puzzle : 100 doors in a row Visit and Toggle the door. What state the door will be after nth pass ?

Given a string, find the first character which is non-repetitive

C++ OOPs Part2

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

Reliance Jio Software Developer Interview Experience

The Magic HackerEarth Nirvana solutions Hiring Challenge

simple sql injection

Check a String is SUBSEQUENCE of another String Find Minimum length for that ( DNA Matching )

Common Ancestor in a Binary Tree or Binary Search Tree

Sort an array according to the order defined by another array

Find two non repeating elements in an array of repeating elements

Trapping Rain Water

Given a float number convert it into the string WITHOUT using any inbuilt Function

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

CodeChef’ RRCOPY

There are N nuts and N bolts, u have to find all the pairs of nuts and bolts in minimum no. of iteration

Memory Efficient LinkedList

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

1014 Practice Question of New GRE – Princeton

SAP Off Campus Hiring_ March 2015 Verbal Skills

Copyright © 2026 · Genesis Framework · WordPress · Log in