Validate Binary Search Tree (LeetCode 98) | Full solution with animations and visuals

Поделиться
HTML-код
  • Опубликовано: 10 фев 2025

Комментарии • 34

  • @ghanashrim2839
    @ghanashrim2839 Год назад +10

    Every time I search for a problem explanation on youtube, I have this immediate sigh of relief, if your video shows up 😁

  • @leonelmessi3010
    @leonelmessi3010 8 месяцев назад +8

    It doesn't matter how long the video is... Clarity is the key to understand and you have it in your videos. Keep it up!

    • @nikoo28
      @nikoo28  8 месяцев назад +1

      i know...sometimes the video gets a little long

  • @everyontech2716
    @everyontech2716 Год назад +2

    this is what i was looking for. The video has explanation of 12 min and 4 min on coding part. Very few youtubers does this. I like your approach. Thank you

    • @nikoo28
      @nikoo28  Год назад +1

      Glad you liked it!

  • @EddyTriedCoding
    @EddyTriedCoding 8 месяцев назад

    update: I really appreciate these tutorials and plan to support your work soon. I had requested coverage on algorithms' time and space complexity, but Nikhil made me realize they are already included in the videos. Thanks for providing such valuable content. Big thanks and God bless you!

    • @nikoo28
      @nikoo28  8 месяцев назад +1

      I talk about the time and space complexity in every problem. It is always near the dry-run of the code

    • @EddyTriedCoding
      @EddyTriedCoding 8 месяцев назад +1

      @@nikoo28 My bad! I'll make sure to reach the end of the videos. I usually pause towards the end to convert the code into Python, which is probably why I haven't finished most of them. Thanks!

  • @knowingly-unknown0
    @knowingly-unknown0 11 месяцев назад +2

    Great aproach Nikhil, you are a saviour

  • @athulsebastian3719
    @athulsebastian3719 8 месяцев назад +1

    Thanks, my brother. You're explanations really help me understand.❤

    • @nikoo28
      @nikoo28  8 месяцев назад +1

      You are very welcome

  • @sahilanand2360
    @sahilanand2360 6 месяцев назад

    I code in cpp, and your solutions are in java, it turns out to be pretty productive for me because i cannot copy it directly and had to use my own brains for the sake of doing the problem hehe...love your videos

  • @navyashreeamam753
    @navyashreeamam753 Год назад +2

    Hi sir, actually I seen Ur backtracking video, very simple explanation I understand easily i commented in that video to make problem solving videos, I didn't get how to solve.
    thankyou 😊

  • @Babas420
    @Babas420 Год назад +1

    great explanation, thanks for doing this!

  • @ayoubelhioui
    @ayoubelhioui 28 дней назад

    Very good explanation, Thank you.

  • @Satya-g5t
    @Satya-g5t 5 месяцев назад

    good explanation always, 😀

  • @prakashnavin6245
    @prakashnavin6245 Год назад

    very nice explanation please keep making such videos

  • @parthmodi2028
    @parthmodi2028 11 месяцев назад

    Great Explaination .Pls keep making more vidoes

  • @maheshj01
    @maheshj01 6 месяцев назад +2

    you are mistaken at 2:04 to say that Subtree 5, 1, 4 satisfies the criteria of a binary search tree. Clearly the right child (4) is less than the parent (5)

    • @serendipity1328
      @serendipity1328 6 месяцев назад +1

      Yup, author made a slight mistake there.

  • @sandeepamarnath3295
    @sandeepamarnath3295 11 месяцев назад

    Very well explained!

    • @nikoo28
      @nikoo28  11 месяцев назад

      Glad it was helpful!

  • @sivan2878
    @sivan2878 Год назад

    Great explanation!

  • @SaumyaSharma007
    @SaumyaSharma007 Год назад

    fab explanation

  • @ikrammaududi6205
    @ikrammaududi6205 8 месяцев назад

    Thanks, so simple

  • @xen0n20p7
    @xen0n20p7 11 месяцев назад

    what a solution !!

  • @kappyM
    @kappyM 4 месяца назад

    It will be better if you will explain iterative and recursive both of solution of every problem

  • @sanjeetnishad3807
    @sanjeetnishad3807 11 месяцев назад

    Actually, in the first example, you selected node 5 to check if it satisfies the bst rule and said it does but i think it doesn't. The roght child should be larger than the node, shouldn't it?

  • @groww-india
    @groww-india Год назад

    Hi Nikhil how you are using this red hi-lighter while explaining could you pls tell.. it's look nice.. which tool you are using for Presentation

    • @nikoo28
      @nikoo28  Год назад

      that will be GoodNotes 6 on iOS

  • @kanaramjangid8563
    @kanaramjangid8563 6 месяцев назад

    Others RUclips videos🤡🤡
    Nikhil sir 👿👿

    • @nikoo28
      @nikoo28  6 месяцев назад

      why the angry devil??

    • @kanaramjangid8563
      @kanaramjangid8563 6 месяцев назад

      @@nikoo28 sir I have lots of respect for you , others RUclips videos just try to finish the code as fast as possible but you explain in best manner. So I gave a devil emojis. You explanation is far better than paid course