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

C++

Bridge Design Pattern Explained With Simple Example: Structural Design Pattern Category

Sandeep Kumarby Sandeep Kumar

The Bridge design pattern is used to separate out interface details and implementation details to reduce the dependency on each other which will provide the flexibility of changing one part without affecting the other part. This design pattern is useful in cases where the class and its function both changes frequently.  For Design patterns basic explanation see (Design Patterns Simplified Version)

(more…)

Bridge Design Pattern Explained With Simple Example: Structural Design Pattern Category Read More

Search

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