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

  • Diameter Protocol AVP Structure
  • Diameter Protocol Message Structure
  • Binary Search Tree Deletion Of Node Explained With Simple Example
  • Autocomplete Feature Using Trie Explained With Simple Example
  • Program To Check Whether A Binary Search Tree Is AVL Tree
  • Maximum Heap Explained With Simple Example
  • AVL Tree Deletion Of Node Explained With Simple Example
  • Hashing Explained With Simple Example
  • new vs malloc and free vs delete explained with simple example
  • Proxy vs Observer design pattern
Copyright © 2026 SimpleTechTalks. Privacy Policy