• 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

Possible sizes of bus to carry n groups of friends

Maximum sum contiguous subarray of an Array

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

flattens 2 D linked list to a single sorted link list

CodeChef Code SGARDEN

Printing Longest Common Subsequence

Handle duplicates in Binary Search Tree

N teams are participating. each team plays twice with all other teams. Some of them will go to the semi final. Find Minimum and Maximum number of matches that a team has to win to qualify for finals ?

Convert Decimal to Roman numbers / Romanizer HackerEarth Code

Urban Ladder Written Test.

Circular Linked List

Print vertical sum of all the axis in the given binary tree

Printing each word reverse in string

LeetCode: Container With Most Water

FizzBuzz Solution C C++

Facebook Interview Question : Interleave List

Maximum occurred Smallest integer in n ranges

Sequence Finder Dynamic Programming

Find the number ABCD such that when multipled by 4 gives DCBA.

1014 Practice Question of New GRE – Princeton

Amazon Interview On-Campus For Internship – 1

Maximum size of square sub matrix with all 1’s in a binary matrix

Number of Islands BFS/DFS

Printing intermediate Integers between one element & next element of array

Templates in C++

Practo Hiring Experience

Diagonal Traversal of Binary Tree

System Design: Designing a LLD for Hotel Booking

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

Python List

Copyright © 2026 · Genesis Framework · WordPress · Log in