• 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

Minimum insertions to form a palindrome

Python String and numbers

1014 Practice Question of New GRE – Princeton

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

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

Check Binary Tree is Binary Search Tree or not

Binary Tree in Java

How Radix sort works

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

DFS (Depth First Search)

Facebook Interview Question : Interleave List

Binary Tree in Java

The greedy coins game Dynamic Programming

Maximum of all subarrays of size k

Python Dictionaries

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

Stock Buy Sell to Maximize Profit

Find position of the only set bit

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

SAP Off Campus Hiring_ March 2015 Analytical Aptitude

Calculate price of parking from parking start end time prices

Adobe Interview Questions 8 month Exp

Find loop in Singly linked list

Print all nodes that are at distance k from a leaf node

Introduction To Number Theory ( Part 1 )

Walmart Labs Interview Experience

Interfaces in C++ (Abstract Classes in C++)

Advanced SQL Injection

SAP Off Campus Hiring_ March 2015 Verbal Skills

Common Ancestor in a Binary Tree or Binary Search Tree

Copyright © 2026 · Genesis Framework · WordPress · Log in