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: prefix

Interview Questions

What are Prefix, Postfix and Infix Expression notations

adminby admin

In order to write any mathematical expression, few notations are being used in which Infix, Prefix and Postfix expressions are the most commonly used notations. Let’s look into these in more details to understand it better.

(more…)
What are Prefix, Postfix and Infix Expression notations Read More

Search

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