ขนาดวิดีโอ: 1280 X 720853 X 480640 X 360
แสดงแผงควบคุมโปรแกรมเล่น
เล่นอัตโนมัติ
เล่นใหม่
Make playback speed to 1.25 and use earphones.
Your way of explaining the logic on the whiteboard and then again via code is super awesome!
Awesome, your way of explaining is really what learners newd.
woww explained so beautifully.
What is the time and space complexity? Time is O(n) and space complexity is also O(n): stack space (in case of skewed tree). Am I correct?
thanks bro for explaning
Happy to helpFollow our linkedin page for regular updates www.linkedin.com/company/codebix/?viewAsMember=true
Amazing !!!!!! Love it
perfact
Nice Solution Dude . Easy to understand . It helped .
@@codebix1096 and it's time complexity will be O(n) ??
@@samratganguly yes
Nice explaination
Thanks
thanks bro i was missing one case returning root when it is closing bracket though i was getting the correct ans ,as inorder traversal was same but the structure got different..
How u reach to root.right block.. as upper if condition true and it ovveride root.left.Please clear my doubt
Same doubt
Think of recursion friend, you will get out from middle if() loop so the third if() will run , not the first one. So no overriding here.
If an input is given to me int string like 123NNNN where N is null, how will you construct the binary tree?
are sir sound system thik kro please adhe subs aisi bdjynge
precise and well explained
You can subscribe to this channel for more such content 😄
@@codebix1096 th-cam.com/channels/ZJRtZh8O6FKWH49YLapAbQ.html p
this code misses a critical case which is "()" which represents empty subtree for a given root
good explanation
Keep watchingThank you. Follow our linkedin page for regular updates www.linkedin.com/company/codebix/?viewAsMember=true
Thanks but what if we want to create a generic/n-ary tree instead of binary tree? 🤦♀️ really hard to create..
Not really, you just have to call recursive function n times in that case with slight modification
I think fourth if loop is not required, second if loop will take care of it, correct me if i am wrong.
No it's required, in fact the if statement on line no 31 is not required, all test cases passed !
starts from 1:00
sound accha karo yaar kuch samujh me hi nhi aa rha hai
Noted.Follow our linkedin page for regular updates www.linkedin.com/company/codebix/?viewAsMember=true
voice too low
渐
gg
@@godjames3063 stfu
%&*@###
sir your voice is very low
notedFollow our linkedin page for regular updates www.linkedin.com/company/codebix/?viewAsMember=true
Make playback speed to 1.25 and use earphones.
Your way of explaining the logic on the whiteboard and then again via code is super awesome!
Awesome, your way of explaining is really what learners newd.
woww explained so beautifully.
What is the time and space complexity?
Time is O(n) and space complexity is also O(n): stack space (in case of skewed tree). Am I correct?
thanks bro for explaning
Happy to help
Follow our linkedin page for regular updates www.linkedin.com/company/codebix/?viewAsMember=true
Amazing !!!!!! Love it
perfact
Nice Solution Dude . Easy to understand . It helped .
@@codebix1096 and it's time complexity will be O(n) ??
@@samratganguly yes
Nice explaination
Thanks
thanks bro i was missing one case returning root when it is closing bracket though i was getting the correct ans ,as inorder traversal was same but the structure got different..
How u reach to root.right block.. as upper if condition true and it ovveride root.left.
Please clear my doubt
Same doubt
Think of recursion friend, you will get out from middle if() loop so the third if() will run , not the first one. So no overriding here.
Think of recursion friend, you will get out from middle if() loop so the third if() will run , not the first one. So no overriding here.
If an input is given to me int string like 123NNNN where N is null, how will you construct the binary tree?
are sir sound system thik kro please adhe subs aisi bdjynge
precise and well explained
You can subscribe to this channel for more such content 😄
@@codebix1096 th-cam.com/channels/ZJRtZh8O6FKWH49YLapAbQ.html p
this code misses a critical case which is "()" which represents empty subtree for a given root
good explanation
Keep watching
Thank you.
Follow our linkedin page for regular updates www.linkedin.com/company/codebix/?viewAsMember=true
Thanks but what if we want to create a generic/n-ary tree instead of binary tree? 🤦♀️ really hard to create..
Not really, you just have to call recursive function n times in that case with slight modification
I think fourth if loop is not required, second if loop will take care of it, correct me if i am wrong.
No it's required, in fact the if statement on line no 31 is not required, all test cases passed !
starts from 1:00
sound accha karo yaar kuch samujh me hi nhi aa rha hai
Noted.
Follow our linkedin page for regular updates www.linkedin.com/company/codebix/?viewAsMember=true
voice too low
渐
gg
@@godjames3063 stfu
%&*@###
sir your voice is very low
noted
Follow our linkedin page for regular updates www.linkedin.com/company/codebix/?viewAsMember=true