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: Linked List Intersection

Interview Questions / Linked List / Programming Questions

Program to find Intersection of Two Linked Lists

adminby admin

Linked List is a data structure used for storing collection of data where successive elements are connected through pointers and the size of linked list can grow or shrink dynamically.
In short, Linked list can be thought as similar to array in which traversal can happen through pointers instead of indexes. Before going ahead have a look into Linked List Basics and Linked List Implementation.

(more…)
Program to find Intersection of Two Linked Lists Read More

Search

  • Difference Between Friend Function and Member Function
  • AVL Tree Self Balancing Rotations – Right Left Rotation explained
  • 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
  • Hash Table With Separate Chaining and Its Basic Implementation
Copyright © 2026 SimpleTechTalks. Privacy Policy