• 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

Reverse a Linked List in groups of given size

Reversal of LinkedList

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

Maximum of all subarrays of size k

Find position of the only set bit

Flipkart Set 1 On Campus with Answers

Amazon Interview Experience – SDE Chennai

Max Sum in circularly situated Values

Get K Max and Delete K Max in stream of incoming integers

Number of Islands BFS/DFS

Printing Longest Common Subsequence

Circular Linked List

Find Percentage of Words matching in Two Strings

Difference between a LinkedList and a Binary Search Tree BST

Inorder and Preorder traversals of a Binary Tree given. Output the Postorder traversal of it.

C++ OOPs Part1

In Given LinkedList Divide LL in N Sub parts and delete first K nodes of each part

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

Memory Efficient LinkedList

SAP Off Campus Hiring_ March 2015 Analytical Aptitude

Subset Sum Problem Dynamic programming

Walmart Labs Interview Experience

Implement a generic binary search algorithm for Integer Double String etc

Find an index i such that Arr [i] = i in array of n distinct integers sorted in ascending order.

Client Server C program

Microsoft BING Interview Experience

Sequence Finder Dynamic Programming

LeetCode : Word Search

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

Spanning Tree

Copyright © 2025 · Genesis Framework · WordPress · Log in