CONVERT BINARY SEARCH TREE TO SORTED DOUBLY LINKED LIST (Leetcode) - Code & Whiteboard
Vložit
- čas přidán 14. 01. 2021
- One of Facebook's most recently asked questions of the past 6 months!
Let me know down below if you have any questions :)
leetcode.com/problems/convert...
---------------------------------------------------------------------------------------------------------------------------------------------------------------
Let's connect on LinkedIn!
/ aleksmitrovic
Follow me on Medium!
/ mitrovic.aleksandar
Questions or suggestions for new videos? Email me!
babybear4812@gmail.com - Věda a technologie
Just had this question in my final round onsite. I used the iterative method.
other than neetcode, was starting to give up on finding a youtuber that is able to explain clearly for beginners and im glad that i found you (subscribed!) thank you for this
tysm Chloe!!! agreed that neetcode is awesome :)
Thanks a lot ! I have been googling around for days to find a solution that is easy to understand. Yours was perfect, can’t thank you enough mate !
love to hear this!! thanks bro :D
Hey man, awesome explanation. I understood the problem within the first 5 minutes due to your great explanations. Thank you!! Please don't stop making these kind of educational videos!
wooo! so happy to hear that bro
Amazing explanation and amazing smile. All the best
thx mohammed!
wow, your communication skills are on point! just earned yourself a sub 👍
appreciate it my man! welcome aboard :D
Great explanation. Love the way you explained it. Thank you :)
much thanks, better than lc solution.
Like your explanations a lot! perfect!
Great job!
This was super helpful, thank you!
Thanks browniebro!
love your explanations man, keep it up!
thx a lot joe :)
This video was very helpful!
thanks Andrew!
Good stuff! Thanks!
THANK YOU for this explanation!
no worries!
Awesome explanation, really helped me a lot! You're really good at explaining things simply! :)
Thanks a lot Luca :)
Great explanation. Thank you!
My pleasure :)
Great Explanatin! thanks
Thanks Rahul!
Did you ever interview at FAANG? And why are you so happy when doing Leetcode ? :-)
1. i don't work in the SWE space
2. i was young and naive :')
Hi! Thanks for explanation. Struggling to understand line 18 here: tail = node. What's the purpose of this if right before this line there is tail.right = node on 13?
tail.right on line 13 sets the next node to the current tail, tail=node sets the new node as the tail