Find Minimum Diameter After Merging Two Trees | Leetcode 3203 | Graph Concepts & Qns - 45 | MIK

Subscribers:
92,300
Published on ● Video Link: https://www.youtube.com/watch?v=uz_WISpySFs



Duration: 0:00
6,234 views
382


iPad PDF Notes Link - https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/iPad PDF Notes/Leetcode-3203-Find Minimum Diameter After Merging Two Trees.pdf
Whatsapp Community Link : https://www.whatsapp.com/channel/0029Va6kVSjICVfiVdsHgi1A

Hi Everyone, this is the 45th video of our Playlist "Graph Concepts & Qns".
In Video-44, we already studied how to find the Diameter Of An Undirected Graph/Tree. We will use the same concept to solve this problem.
Video-44 Link - Diameter Of Undirected Graph | Tree Diameter | Leetcode 1245 -    • Diameter Of Undirected Graph | Tree D...  

Problem Name : Find Minimum Diameter After Merging Two Trees | Leetcode 3203 | Graph Concepts & Qns - 45 | Explanation + Code
Company Tags : Will update later
My solutions on Github(C++ & JAVA) - https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Graph/BFS_DFS/Find Minimum Diameter After Merging Two Trees.cpp
Leetcode Link : https://leetcode.com/problems/find-minimum-diameter-after-merging-two-trees



My DP Concepts Playlist :    • Roadmap for DP | How to Start DP ? | ...  
My Graph Concepts Playlist :    • Graph Concepts & Qns - 1 : Graph will...  
My Segment Tree Concepts Playlist :    • Segment Tree | Introduction | Basics ...  
My Recursion Concepts Playlist :    • Introduction | Recursion Concepts And...  
My GitHub Repo for interview preparation : https://github.com/MAZHARMIK/Interview_DS_Algo
Instagram : https://www.instagram.com/codestorywithmik/
Facebook : https://www.facebook.com/people/codestorywithmik/100090524295846/
Twitter : https://twitter.com/CSwithMIK
Subscribe to my channel :    / @codestorywithmik  

╔═╦╗╔╦╗╔═╦═╦╦╦╦╗╔═╗
║╚╣║║║╚╣╚╣╔╣╔╣║╚╣═╣
╠╗║╚╝║║╠╗║╚╣║║║║║═╣
╚═╩══╩═╩═╩═╩╝╚╩═╩═╝


Video Summary :
To calculate the minimum diameter after merging two trees, the approach involves:

Building the Adjacency List:
Construct the adjacency list for both trees using the given edges, stored in a Map.

Calculating Tree Diameters:
Use a two-step BFS approach to calculate the diameter of each tree:

First BFS finds the farthest node from any arbitrary node (e.g., node 0).
Second BFS from the farthest node gives the tree's diameter.
Merging the Trees:
The combined diameter is computed as (d1 + 1) / 2 + (d2 + 1) / 2 + 1.

Result:
The final result is the maximum of the three values: the diameter of tree 1, tree 2, and the combined diameter.


✨ Timelines✨
00:00 - Introduction
0:38 - Motivation
1:12 - Problem Explanation
3:39 - Thought Process
14:44 - Corner Case
19:40 - Coding it up


#MIK #mik #Mik
#coding #helpajobseeker #easyrecipes #leetcode #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge #leetcodequestions #leetcodechallenge #hindi #india #coding #helpajobseeker #easyrecipes #leetcode #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge #leetcodequestions #leetcodechallenge #hindi #india #hindiexplanation #hindiexplained #easyexplaination #interview#interviewtips #interviewpreparation #interview_ds_algo #hinglish #github #design #data #google #video #instagram #facebook #leetcode #computerscience #leetcodesolutions #leetcodequestionandanswers #code #learning #dsalgo #dsa #coding #programming #100daysofcode #developers #techjobs #datastructures #algorithms #webdevelopment #softwareengineering #computerscience #pythoncoding #codinglife #coderlife #javascript #datascience #leetcode #leetcodesolutions #leetcodedailychallenge #codinginterview #interviewprep #technicalinterview #interviewtips #interviewquestions #codingchallenges #interviewready #dsa #hindi #india #hindicoding #hindiprogramming #hindiexplanation #hindidevelopers #hinditech #hindilearning #helpajobseeker #jobseekers #jobsearchtips #careergoals #careerdevelopment #jobhunt #jobinterview #github #designthinking #learningtogether #growthmindset #digitalcontent #techcontent #socialmediagrowth #contentcreation #instagramreels #videomarketing #codestorywithmik #codestorywithmick #codestorywithmikc #codestorywitmik #codestorywthmik #codstorywithmik #codestorywihmik #codestorywithmiik #codeistorywithmik #codestorywithmk #codestorywitmick #codestorymik #codestorwithmik




Other Videos By codestorywithMIK


2025-01-02Maximum Non Negative Product in a Matrix | Recursion | Memo | Bottom Up | Leetcode 1594 |DP On Grids
2025-01-01Count Vowel Strings in Ranges | Simple Thought Process | Leetcode 2559 | codestorywithMIK
2024-12-312025 Placement Roadmap | How I Would Have Prepared | Year 2025 Special | Happy New Year
2024-12-31What is special about year 2025 ?
2024-12-27Maximum Sum of 3 Non-Overlapping Subarrays | Detailed For Beginners | Leetcode 689 | codstorywithMIK
2024-12-26Best Sightseeing Pair | 3 Approaches | Detailed For Beginners | Leetcode 1014 | codestorywithMIK
2024-12-26Unique Paths II | Recursion | Memo | Bottom Up | Leetcode 63 | DP On Grids | codestorywithMIK
2024-12-25Target Sum | Two Ways Of Memoization | Detailed | Leetcode 494 | Explanation + Code
2024-12-24Find Building Where Alice and Bob Can Meet | Segment Tree Concepts & Qns | Video 11 | Leetcode 2940
2024-12-24Range Maximum Index Query | Part 2 | Segment Tree Concepts & Qns | Video 10 | codestorywithMIK
2024-12-24Find Minimum Diameter After Merging Two Trees | Leetcode 3203 | Graph Concepts & Qns - 45 | MIK
2024-12-24Diameter Of Undirected Graph | Tree Diameter | Leetcode 1245 | Graph Concepts & Qns - 44 | MIK
2024-12-23Range Maximum Index Query | Part 1 | Segment Tree Concepts & Qns | Video 9 | codestorywithMIK
2024-12-23Thank You For The Trust 🙏❤️🥺
2024-12-23Minimum Number of Operations to Sort a Binary Tree by Level | Leetcode 2471 | codestorywithMIK
2024-12-19Reverse Odd Levels of Binary Tree | Detailed | DFS | BFS | Leetcode 2415 | codestorywithMIK
2024-12-19Max Chunks To Make Sorted | 3 Detailed Approaches | Leetcode 769 | codestorywithMIK
2024-12-17Final Prices With a Special Discount in a Shop | Something to learn |Leetcode 1475 |codestorywithMIK
2024-12-17Unique Paths | Recursion | Memo | Bottom Up | Leetcode 62 | DP On Grids | codestorywithMIK
2024-12-16Construct String With Repeat Limit | 2 Simple Approaches | Leetcode 2182 | codestorywithMIK
2024-12-16Introduction | DP On Grids | Part 2 | DP Concepts & Qns-30 | codestorywithMIK