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

  • @dandandan3675
    @dandandan3675 11 месяцев назад +12

    omg. tysm!!! please don't stop making these types of videos

  • @riancmd
    @riancmd 16 дней назад

    Really concise and straight to the point. I'm reviewing for my exam today so this helped me a lot! Thank you.

  • @Vincent-qh4rg
    @Vincent-qh4rg 10 месяцев назад +4

    Your videos are too good🐐

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

    straight to the point 🔥🔥🔥🔥🔥

  • @mohsinshahbaz5846
    @mohsinshahbaz5846 6 месяцев назад +43

    exam in 1 hour

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

      same situation

    • @koffeltuff1231
      @koffeltuff1231 Месяц назад +2

      Outside the hall

    • @ayushvaze1622
      @ayushvaze1622 Месяц назад +2

      After exam preparing for re exam already knows result

    • @VorloFay
      @VorloFay 4 дня назад

      @@ayushvaze1622 yo i cheated of you....i got 0

  • @D3ebK
    @D3ebK Год назад +7

    🐐

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

    What happen if you delete root?

  • @user-bz2tu8do7q
    @user-bz2tu8do7q 9 месяцев назад

    Hi, I loved your video ! I'm watching you since a long time, I've seen almost all your videos about sort algorithms ( insertion, selection, bubble sort, etc.).
    I just wanted to ask, how do you make these ? I mean, what software do you use to make these videos ? and what material do you use ?
    Thank you very much for the answer and for the time spent.

    • @MichaelSambol
      @MichaelSambol 9 месяцев назад +1

      Thanks for the kind feedback! It's Keynote and iMovie.

    • @user-bz2tu8do7q
      @user-bz2tu8do7q 9 месяцев назад

      Thank you !@@MichaelSambol

  • @tayyabsami258
    @tayyabsami258 7 месяцев назад

    Cool man really helped alot

  • @nullptr.
    @nullptr. 2 месяца назад

    Tyvm!
    Out of curiosity, are you guys learning DSA in Python? my class is in C

    • @MichaelSambol
      @MichaelSambol 2 месяца назад

      We did Java when I was in school. Depends on your college. I chose Python here because I think it's easiest to learn: github.com/msambol/dsa.

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

    you a goat fr

  • @kazraven9086
    @kazraven9086 9 месяцев назад

    Can you make a video about Johnson's algorithm?

    • @MichaelSambol
      @MichaelSambol 9 месяцев назад +1

      Will add it to the list 👍🏼

    • @kazraven9086
      @kazraven9086 9 месяцев назад

      Thanks! love your videos @@MichaelSambol

  • @typingcat
    @typingcat 5 месяцев назад

    01:24 What if that "in-order successor" has children? In the example, 125 had no children, so it was simple but what if 125 had children?

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

      In inorder successor we have to go to right subtree and go to its left most value

  • @chudchadanstud
    @chudchadanstud 10 месяцев назад +1

    It's all fun and games until you have to do it iteratively

  • @the3rdson
    @the3rdson 2 месяца назад

    Height is the number of edges, the height in your video is wrong

    • @the3rdson
      @the3rdson 2 месяца назад

      You gotta double check your stuff my guy 😭, people could and probably have lost points because of that simple mistake...

    • @MichaelSambol
      @MichaelSambol 2 месяца назад

      There are a few ways you can define it. I chose "the number of nodes on the longest path from the root to a leaf." As long as you are consistent, the balance factor will be the same.

    • @the3rdson
      @the3rdson 2 месяца назад

      @@MichaelSambol I see, thanks for clarifying

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

    Tommorow is exam

  • @wawa_game
    @wawa_game 2 месяца назад

    exam in 20 Minutes