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

C++ / Interview Questions / Programming

State Design Pattern explained with simple example

adminby admin

State design pattern allows an object to change its behaviour whenever its state changes. This design pattern is very similar to state machines in which behaviour of an object based on an event is dependent on the its state. This design pattern makes the software easily extensible as adding new states are quite easy because it doesn’t affect the behaviour of existing states.

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

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

Search

  • AVL Tree Self Balancing Rotations – Right Left(RL) Rotation explained
  • new vs malloc() and delete vs free() in C++
  • Binary Search Tree Deletion Of Node Explained With Simple Example
  • Trie Data Structure Basics and Implementation Explained With Simple Example
  • AVL Tree Self Balancing Rotations – Left Right (LR) Rotation explained
  • AVL Tree Deletion Of Node Explained With Simple Example
  • Shortest Path in an Unweighted Graph Using BFS
  • Binary Tree Inorder Traversal Explained With Simple Example
  • Binary Search Tree Insertion Of Node Explained With Simple Example
  • Autocomplete Feature Using Trie Explained With Simple Example
Copyright © 2026 SimpleTechTalks. Powered by WordPress and Bam.