Create Binary Tree From Descriptions | Simplest Approach | Leetcode 2196 | codestorywithMIK
349Whatsapp Community Link : https://www.whatsapp.com/channel/0029...
This is the 45th Video of our Playlist "Binary Tree : Popular Interview Problems" by codestorywithMIK
In this video we will try to solve a very good Tree Problem : Create Binary Tree From Descriptions | Simplest Approach | Leetcode 2196 | 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 : Create Binary Tree From Descriptions | Simplest Approach | Leetcode 2196 | codestorywithMIK
Company Tags : UBER
My solutions on Github(C++ & JAVA) : https://github.com/MAZHARMIK/Intervie...
Leetcode Link : https://leetcode.com/problems/create-...
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/Intervie...
Instagram : / codestorywithmik
Facebook : / 100090524295846
Twitter : / cswithmik
Subscribe to my channel : / @codestorywithmik
╔═╦╗╔╦╗╔═╦═╦╦╦╦╗╔═╗
║╚╣║║║╚╣╚╣╔╣╔╣║╚╣═╣
╠╗║╚╝║║╠╗║╚╣║║║║║═╣
╚═╩══╩═╩═╩═╩╝╚╩═╩═╝
Summary :
The given approach creates a binary tree from a list of descriptions, where each description contains a parent node, a child node, and an indicator of whether the child is a left child.
Initialize Data Structures:
mp : An unordered map to store pointers to TreeNode objects, keyed by their values.
childSet: An unordered set to keep track of all child nodes.
Process Each Description:
For each description in the input list:
Extract the parent, child, and isLeft (indicating whether the child is a left child).
If the parent node is not already in nodes, create a new TreeNode for it and add it to nodes.
If the child node is not already in nodes, create a new TreeNode for it and add it to nodes.
Establish the parent-child relationship:
If isLeft is true, set the left child of the parent node.
Otherwise, set the right child of the parent node.
Add the child node to childSet.
Identify the Root Node:
Iterate through the descriptions again to find the root node, which is a node that is never a child.
The root node is the node in nodes that is not present in childSet.
Return the Root Node:
Return the root node found in the previous step. If no such node is found, return nullptr.
This method ensures that all nodes are created and linked correctly according to the given descriptions, and efficiently identifies the root node by excluding any node that appears as a child.
✨ Timelines✨
00:00 - Introduction
0:20 - Problem Explanation
2:52 - Simple Thought Process + Dry Run
13:12 - Coding it Up
#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 #newyear2024