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

  • 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.