Height of Binary Tree After Subtree Removal Queries |Thought Process|Leetcode 2458| codestorywithMIK

Subscribers:
101,000
Published on ● Video Link: https://www.youtube.com/watch?v=eEfW7CLbhvU



Duration: 0:00
8,448 views
471


Whatsapp Community Link : https://www.whatsapp.com/channel/0029Va6kVSjICVfiVdsHgi1A
This is the 52th Video of our Playlist "Binary Tree : Popular Interview Problems" by codestorywithMIK

In this video we will try to solve a very good Binary Tree Problem : Height of Binary Tree After Subtree Removal Queries | Complete Thought Process | Leetcode 2458 | codestorywithMIK

I will explain the intuition so easily that you will never forget and start seeing this as cakewalk EASYYY.
We will do live coding after explanation and see if we are able to pass all the test cases.
Also, please note that my Github solution link below contains both C++ as well as JAVA code.

Problem Name : Height of Binary Tree After Subtree Removal Queries | Complete Thought Process | Leetcode 2458 | codestorywithMIK
Company Tags : will update soon
My solutions on Github(C++ & JAVA) - https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Tree/Height of Binary Tree After Subtree Removal Queries.cpp
Leetcode Link : https://leetcode.com/problems/height-of-binary-tree-after-subtree-removal-queries


My DP Concepts Playlist :    • Roadmap for DP | How to Start DP ? | ...  
My Graph Concepts Playlist :    • Graph Concepts & Qns - 1 : Graph will...  
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  

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

Summary :
The solution involves calculating the maximum height reachable after virtually removing certain nodes in a binary tree, where each node’s deletion is treated as a query.

Preprocessing Heights and Levels:
findHeight recursively computes the height of each node, storing it in height[node]. The node’s level is stored in level[node].
For each level, levelMaxHt[level] keeps track of the maximum height at that level, while levelSecondMaxHt[level] stores the second-highest height.
Handling Queries Efficiently:
For each node in queries, the solution determines its level L and height.
The result for removing a node at L is calculated as L + H - 1, where H is the maximum height at that level, excluding the queried node’s height if it is the current maximum. This helps in efficiently recalculating the height after removing a node.
This preprocessing approach allows each query to be handled in constant time, making the solution efficient for large trees and multiple queries.



✨ Timelines✨
00:00 - Introduction

#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


2024-11-03Consistency is the key
2024-11-02String Compression III | Simple Simulation | Leetcode 3163 | codestorywithMIK
2024-11-01Rotate String | Something to learn | Leetcode 796 | codestorywithMIK
2024-10-30Minimum Total Distance Traveled | Detailed Thought Process | Leetcode 2463 | codestorywithMIK
2024-10-30Delete Characters to Make Fancy String | Simple & Easy | Leetcode 1957 | codestorywithMIK
2024-10-28Minimum Number of Removals to Make Mountain Array | Thought Process | Leetcode 1671|codestorywithMIK
2024-10-28Maximum Number of Moves in a Grid | Simplest Approach | Leetcode 2684 | codestorywithMIK
2024-10-27DSA Shorts with MIK - 7
2024-10-26Longest Square Streak in an Array | Detailed Approaches | Dry Run | Leetcode 2501 | codestorywithMIK
2024-10-25Count Square Submatrices with All Ones | Recursion | Bottom Up | Leetcode 1277 | codestorywithMIK
2024-10-24Height of Binary Tree After Subtree Removal Queries |Thought Process|Leetcode 2458| codestorywithMIK
2024-10-23Remove Sub-Folders from the Filesystem | 2 Simple Approaches | Leetcode 1233 | codestorywithMIK
2024-10-22Flip Equivalent Binary Trees | Simple Recursion | Dry Run | Leetcode 951 | codestorywithMIK
2024-10-21Cousins in Binary Tree II | 2 Detailed Approaches | Dry Run | Leetcode 2641 | codestorywithMIK
2024-10-20Parsing A Boolean Expression | Cleanest Explanation | Dry Run | Leetcode 1106 | codestorywithMIK
2024-10-19Split a String Into the Max Number of Unique Substrings | Khandani Template | Dry Run |Leetcode 1593
2024-10-19Find Kth Bit in Nth Binary String | Detailed Recursion | Dry Run | Leetcode 1545 | codestorywithMIK
2024-10-17Count Number of Maximum Bitwise-OR Subsets | Simplest Approach |Leetcode 2044 | codestorywithMIK
2024-10-17Maximum Swap | 2 Simple Approaches | Leetcode 670 | codestorywithMIK
2024-10-15Longest Happy String | Simple Thought Process | Leetcode 1405 | codestorywithMIK
2024-10-14Separate Black and White Balls | 2 Simple Ways | Leetcode 2938 | codestorywithMIK