Skip to content

SimpleTechTalks

To make technologies simpler

  • Home
  • Data Structures
    • Linked List
    • Graph
    • Hashing
    • Stack
    • Queue
    • Priority Queue
    • Tree
      • Binary Tree
      • Binary Search Tree
    • wordpress
  • Programming
    • Unix
    • Dynamic Programming
    • C
    • C++
      • C++11
    • Python
  • Technology
    • Diameter
    • Microservices
    • Networking
    • Telecom
    • Tools
  • Questions & Answers
    • Programming Questions
    • Interview Questions
  • Contact Us
  • Home
  • Data Structures
    • Linked List
    • Graph
    • Hashing
    • Stack
    • Queue
    • Priority Queue
    • Tree
      • Binary Tree
      • Binary Search Tree
    • wordpress
  • Programming
    • Unix
    • Dynamic Programming
    • C
    • C++
      • C++11
    • Python
  • Technology
    • Diameter
    • Microservices
    • Networking
    • Telecom
    • Tools
  • Questions & Answers
    • Programming Questions
    • Interview Questions
  • Contact Us

Tag: POP

Interview Questions / Stack

Stack basics and representation

adminby admin

Stack is a data structure used for storing collection of data where order in which data is arriving is important. In Stack, insertion and deletion both happened from the same end which is known as “Top”.
The data which is arrived last will be deleted first in Stack. This data ordering is called as Last in First out or LIFO.

(more…)
Stack basics and representation Read More

Search

  • Diameter Protocol AVP Structure
  • Diameter Protocol Message Structure
  • C++11: extern template Explained With Simple Example
  • Binary Search Tree Deletion Of Node Explained With Simple Example
  • AVL Tree Explanation With Simple Examples
  • Monostate Design Pattern explained with simple example
  • Maximum Heap Explained With Simple Example
  • AVL Tree Deletion Of Node Explained With Simple Example
  • Difference Between Macros and Inline Functions
  • Difference between Copy constructor vs Move constructor
Copyright © 2026 SimpleTechTalks. Privacy Policy