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: Visitor Design Pattern

C++ / Interview Questions / Programming

Visitor Design Pattern explained with simple example

adminby admin

The visitor design pattern allows a programmer to separate algorithms of the module from the object or class. This will allow to modify algorithm by adding or removing new functionalities without altering objects structure. This design pattern basically allows us to add a functionality to every element without altering their structure.

Before going ahead have a look at Design pattern simplified version.

(more…)
Visitor Design Pattern explained with simple example Read More

Search

  • AVL Tree Self Balancing Rotations – Right Left Rotation explained
  • Difference Between Friend Function and Member Function
  • Binary Search Tree Deletion Of Node Explained With Simple Example
  • Diameter Protocol Message Structure
  • AVL Tree Deletion Of Node Explained With Simple Example
  • new vs malloc and free vs delete explained with simple example
  • Maximum Heap Explained With Simple Example
  • Diameter Protocol AVP Structure
  • Shortest path in unweighted graph explained with simple example
  • Diameter Agents Simple Explanation
Copyright © 2026 SimpleTechTalks. Privacy Policy