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: Postfix evaluation

Interview Questions / Programming Questions / Stack

Program to evaluate Postfix expression

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. Before going ahead have a look into Stack basics and Generic Stack Implementation.

(more…)
Program to evaluate Postfix expression Read More

Search

  • new vs malloc() and delete vs free() in C++
  • Binary Search Tree Deletion Of Node Explained With Simple Example
  • Diameter Protocol Message Structure
  • AVL Tree Deletion Of Node Explained With Simple Example
  • AVL Tree Self Balancing Rotations – Right Left(RL) Rotation explained
  • Program To Check Whether A Binary Search Tree Is AVL Tree
  • Shortest Path in an Unweighted Graph Using BFS
  • AVL Tree Self Balancing Rotations – Left Right (LR) Rotation explained
  • Trie Data Structure Basics and Implementation Explained With Simple Example
  • Diameter Protocol AVP Structure
Copyright © 2026 SimpleTechTalks. Powered by WordPress and Bam.