Maximum Depth of Binary Tree | Leet code 104 | Theory explained + Python code

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

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

  • @nands4410
    @nands4410 4 года назад +3

    Nice, i took a break from leetcode mid October and now I'm back in the grind with the December challenge!!
    Let's do this!!

  • @rajatsharma6597
    @rajatsharma6597 2 года назад

    thanks guru ji

  • @afsinyilmaz8665
    @afsinyilmaz8665 3 года назад

    awesome explanation..

  • @ishayadav5221
    @ishayadav5221 4 года назад

    Amazing!

  • @saugatsaxena
    @saugatsaxena 3 года назад

    Thanks Anish, This was very helpful. Though I wish you couple explain more on DFS. I see nodes return a None Type on every recursion. Unsure how + 1 works on them then.