• 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

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

Reliance Jio Software Developer Interview Experience

How strtok() Works

Client Server C program

Urban Ladder Written Test.

Cisco Hiring Event 21st – 22nd Feb 2015

Binary Tree Isomorphic to each other

Common Ancestor in a Binary Tree or Binary Search Tree

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

System Design: Designing a LLD for Hotel Booking

Print Power Set of a Set

Possible sizes of bus to carry n groups of friends

Best Java Book | Top Java Programming Book for Beginners

Password Predictor

ADOBE Aptitude C Language Test

Right view of Binary tree

Handle duplicates in Binary Search Tree

Find the element that appears once others appears thrice

Find two non repeating elements in an array of repeating elements

Level order traversal in Spiral form

Calculate price of parking from parking start end time prices

Longest Increasing Subsequence

Generate largest number arranging a no. of given non negative integer numbers

Edit Distance ( Dynamic Programming )

Code Chef PRGIFT Solution

Circular Linked List

building with N steps, we can take 1,2,3 steps calculate number of ways to reach at top of building

Printing Longest Common Subsequence

The Magic HackerEarth Nirvana solutions Hiring Challenge

LeetCode: Container With Most Water

Copyright © 2026 · Genesis Framework · WordPress · Log in