• 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

Singly linked list

Get Minimum element in O(1) from input numbers or Stack

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

flattens 2 D linked list to a single sorted link list

Knight Tour Problem (Graph – Breadth First Search)

SAP Interview Questions

VMWare SDEII Interview

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

Hackerearth : Counting Subarrays

Serialise Deserialise N-ary Tree

LeetCode : Word Search

Edit Distance ( Dynamic Programming )

C++ OOPs Part2

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

Length of the longest substring without repeating characters

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

Closed Parentheses checker

Spanning Tree

Calculate price of parking from parking start end time prices

Printing intermediate Integers between one element & next element of array

Stickler thief

Given Set of words or A String find whether chain is possible from these words or not

How Radix sort works

Top 10 Interviews Techniqes for Campus Interview in IIT NIT BITS for MTech

Convert Decimal to Roman numbers / Romanizer HackerEarth Code

25 horses 5 tracks Find 3 fastest puzzle

write a c program that given a set a of n numbers and another number x determines whether or not there exist two elements in s whose sum is exactly x

Naurki.com Security Breach

Check if an array has duplicate numbers in O(n) time and O(1) space

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

Copyright © 2026 · Genesis Framework · WordPress · Log in