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

  • Difference Between Friend Function and Member Function
  • Binary Search Tree Deletion Of Node Explained With Simple Example
  • AVL Tree Deletion Of Node Explained With Simple Example
  • Diameter Protocol AVP Structure
  • Diameter Protocol Basics
  • Diameter Protocol Message Structure
  • C++11: extern template Explained With Simple Example
  • AVL Tree Explanation With Simple Examples
  • Program To Check Whether A Binary Search Tree Is AVL Tree
  • Maximum Heap Explained With Simple Example
Copyright © 2025 SimpleTechTalks. Privacy Policy