CONVERT BINARY SEARCH TREE TO SORTED DOUBLY LINKED LIST (Leetcode) - Code & Whiteboard

Sdílet
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

Komentáře • 34

  • @Makishima240
    @Makishima240 Před 3 lety +4

    Just had this question in my final round onsite. I used the iterative method.

  • @chloe3337
    @chloe3337 Před 2 lety +3

    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

  • @prashanth123456789
    @prashanth123456789 Před 3 lety +3

    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 !

  • @arjunbharadwaj1820
    @arjunbharadwaj1820 Před 3 lety +5

    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!

  • @mohammadkareem1187
    @mohammadkareem1187 Před 2 lety +2

    Amazing explanation and amazing smile. All the best

  • @davidgutierrez921
    @davidgutierrez921 Před 2 lety

    wow, your communication skills are on point! just earned yourself a sub 👍

  • @TheNealtt
    @TheNealtt Před 3 lety

    Great explanation. Love the way you explained it. Thank you :)

  • @only_oneone1751
    @only_oneone1751 Před 2 lety

    much thanks, better than lc solution.

  • @ameynaik2743
    @ameynaik2743 Před 2 lety

    Like your explanations a lot! perfect!

  • @yuantu2236
    @yuantu2236 Před 2 lety

    Great job!

  • @browniebro
    @browniebro Před 2 lety

    This was super helpful, thank you!

  • @joevice376
    @joevice376 Před 3 lety

    love your explanations man, keep it up!

  • @andrewyuan7881
    @andrewyuan7881 Před 2 lety

    This video was very helpful!

  • @今天比昨天厲害
    @今天比昨天厲害 Před 3 lety

    Good stuff! Thanks!

  • @willowsongbird
    @willowsongbird Před 2 lety

    THANK YOU for this explanation!

  • @lukt
    @lukt Před 2 lety

    Awesome explanation, really helped me a lot! You're really good at explaining things simply! :)

  • @Paunitza
    @Paunitza Před 3 lety

    Great explanation. Thank you!

  • @rahulbhardwaj4568
    @rahulbhardwaj4568 Před 2 lety

    Great Explanatin! thanks

  • @rydmerlin
    @rydmerlin Před rokem +1

    Did you ever interview at FAANG? And why are you so happy when doing Leetcode ? :-)

    • @babybear-hq9yd
      @babybear-hq9yd  Před rokem +1

      1. i don't work in the SWE space
      2. i was young and naive :')

  • @user-sr1pk3yy8b
    @user-sr1pk3yy8b Před 3 lety

    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?

    • @prashanth123456789
      @prashanth123456789 Před 3 lety +2

      tail.right on line 13 sets the next node to the current tail, tail=node sets the new node as the tail