Flatten Binary Tree to Linked List | Live Coding with Explanation | Leetcode - 114

[@AlgorithmsMadeEasy]

We hope you all are enjoying our videos!!! Don't forget to leave a comment!!! Please like the video to support us!!! Questions you might like: ✅✅✅[ Tree Data Structure] : kzbin.info/aero/PLJtzaiEpVo2zx-rCqLMmcFEpZw1UpGWls ✅✅✅[ Graphs Data Structure] : kzbin.info/aero/PLJtzaiEpVo2xg89cZzZCHqX03a1Vb6w7C ✅✅✅[ January 2021 Leetcoding Challenge] : kzbin.info/aero/PLJtzaiEpVo2wCalBcRcNjXQ0C6ku3dRkn ✅✅✅[ February 2021 Leetcoding Challenge] : kzbin.info/aero/PLJtzaiEpVo2wrfvII0eZQsPm-MZCmHodm ✅✅✅[ March 2021 Leetcoding Challenge] : kzbin.info/aero/PLJtzaiEpVo2zH-YC5ZiptbAvw2QZkmyk9 ✅✅✅[ April 2021 Leetcoding Challenge] :kzbin.info/aero/PLJtzaiEpVo2z9PpcJcsl5j3RXutiTU-GB ✅✅✅[ December 2020 Leetcoding Challenge] : kzbin.info/aero/PLJtzaiEpVo2xo8OdPZxrpybGR8FmzZpCA ✅✅✅[ November 2020 Leetcoding Challenge] : kzbin.info/aero/PLJtzaiEpVo2yMYz5RPH6pfB0wNnwWsK7e ✅✅✅[ August 2020 Leetcoding Challenge] : kzbin.info/aero/PLJtzaiEpVo2xu4h0gYQzvOMboclK_pZMe ✅✅✅[ July 2020 Leetcoding challenges] : kzbin.info/aero/PLJtzaiEpVo2wrUwkvexbC-vbUqVIy7qC- ✅✅✅[ June 2020 Leetcoding challenges] : kzbin.info/aero/PLJtzaiEpVo2xIPptnCvUtKrUcod2zAKG ✅✅✅[ May 2020 Leetcoding challenges] : kzbin.info/aero/PLJtzaiEpVo2wRmUCq96zsUwOVD6p66K9e ✅✅✅ Cracking the Coding Interview - Unique String: kzbin.info/aero/PLJtzaiEpVo2xXf4LZb3y_BopOnLC1L4mE Struggling in a question?? Leave in a comment and we will make a video!!!🙂🙂🙂

[@miguelangelfigueroadelgado1381]

The time complexity of the first approach is O(n^2) because of the while loop will be traversing the nodes on each recursive call, don't you think so?

[@AviatorBro]

it will be O(n) only, because it's recursion. try doing it on paper and drawing the recursion tree

[@miguelangelfigueroadelgado1381]

@@AviatorBro the while loop to find the last element to which you add the right (min 6:00), that loop can traverse all elements so O(n) at each recursive call

[@numseidizer]

Yes, O(n²).

[@vibhoragarwal5425]

Correct O(n2)

[@poorpanda9033]

What a great explanation ! Please do more leetcode questions !

[@3darpan]

Your first solution is definitely not in O(n) time complexity, although the space complexity is correct.

[@brendanvoelz]

Agreed. It's O(n log n) assuming the tree is balanced

[@adithyakashyap64]

I have seen 10 different varioations of code in different videos and in discussion section of LeetCode. Nothing was explained so simple and clear . Way to go !!

[@AlgorithmsMadeEasy]

Glad it was helpful! Don't forget to share and subscribe!!

[@akkzhol1]

Thanks for your videos! Brief and clear!

[@geekySRM]

This was the only video I understood from! Thanks a ton!

[@AlgorithmsMadeEasy]

Glad you like it !!

[@xinchenyi9878]

Agree! I finally understood Morris Traverse from this video!

[@nikhilaggarwal9325]

Highly underrated channel, the way you both explain the code is really cool. It's high time for this channel to get it's deserving reach. Hope it really grows fast.

[@AlgorithmsMadeEasy]

Glad you think so!

[@rajeevsai91]

Very clear explanation. Animations were also superb. Happy that I found this channel.

[@AlgorithmsMadeEasy]

Glad to hear that!

[@vamsiarja1258]

This is a really great explanation🤩

[@AlgorithmsMadeEasy]

Glad it was helpful!

[@uttarandas8113]

Great explanation. Short and sweet.

[@siddharthdwivedi3263]

Nicely explained ,with clear visualization and best possible intuition!!

[@AlgorithmsMadeEasy]

Thanks. Glad you liked it !!

[@vyankateshkulkarni4374]

thank you mam for great explanation.

[@bruteforce676]

Loved the way of explanation

[@edwinanto2003]

great explanation.. Thank you so much 👍

[@vivekpaliwal1876]

Nice visual explanation

[@programmer5280]

Best Explaination🔥.. Finally I Understand the Concept of this question. Thanks alot!!

[@AlgorithmsMadeEasy]

Happy to help

[@i.vigneshdavid1698]

Nicely Explained

[@jackwalker2947]

Nice Explanation thanks❣️

[@AlgorithmsMadeEasy]

Thanks!

[@eecs482]

This is great solution. Thank you

[@謝育能-s5s]

Good explanation .

[@AlgorithmsMadeEasy]

Thankyou

[@hymnish_you]

I binge your channel :D Such an awesome explanation of each problem and I got to know about Morris's behavior. Thanks

[@AlgorithmsMadeEasy]

Happy to help!

[@commentator2407]

very helpful

[@AyushKumar-fk5lm]

Amazing! Absolutely loved it. Subscribed channel :)

[@AlgorithmsMadeEasy]

Thanks Ayush !!

[@rahulbabu9141]

Thank you for excellent explanation mam

[@AlgorithmsMadeEasy]

Happy to help !!

[@anaygondhalekar7330]

Thanks a lott

[@AlgorithmsMadeEasy]

Welcome 👍

[@saarthjhaveri8716]

superb explainationnnn

[@sakshiramsinghani5284]

Nice and clear explanation. I was stuck on this problem for a long time. Keep up the good work 👍

[@AlgorithmsMadeEasy]

Glad you like it !!

[@feelyourbeat7820]

Great

[@AlgorithmsMadeEasy]

Thanks

[@Nine7383]

Can someone explain why the recursive algorithm is O(N) and not O(N^2) since there is a while loop?

[@ketanahuja8939]

We are going to every node at most once , thats why ,, think always in this way , how many times i m going to 1 node , u will get clear idea in tree recursive solutions..Thanks

[@manishperiwal515]

How is the second solution working, since we changed the root.

[@anamariaaguilarcahuana9417]

Hello Khushbu I am currently 17 years old, I saw several of your videos and you always mention the time of complexity, my question is How do you find that time, do you recommend a book to learn and practice? Thank you, your videos inspire me to be better

[@AlgorithmsMadeEasy]

Thanks for your comment Ana. For time complexity, you can refer a lot of books. Mostly, every book that has DSA will start with explaining complexity analysis. For example "Data Structures and Algorithms" by Narsimha Karumanchi OR "Cracking the Coding Interview" by Gayle McDowell

[@kotlintpoint4290]

Nice tutorial...i like it!!!

[@AlgorithmsMadeEasy]

Glad to hear that!

[@commentator2407]

i love u... just wow ......

[@Prashantkumar-pn6qq]

Wanna share some system design resources?