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: Expression notation

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

  • Program To Check Whether A Binary Search Tree Is AVL Tree
  • AVL Tree Self Balancing Rotations – Right Left Rotation explained
  • Binary Search Tree Deletion Of Node Explained With Simple Example
  • Diameter Protocol Message Structure
  • Hashing Explained With Simple Example
  • Python string operations: Indexing and Slicing
  • AVL Tree Self Balancing Rotations – Left Right Rotation explained
  • Diameter Protocol AVP Structure
  • Difference Between Friend Function and Member Function
  • Program to Count the leaf nodes in a Binary Tree
Copyright © 2026 SimpleTechTalks. Privacy Policy