Binary Tree Level Order Traversal - LeetCode 102 Python

preview_player
Показать описание
Explaining Binary Tree Level Order Traversal in Python

O(n) time and space!

Music: Bensound

Lemme know up if y'all have any questions/comments!:)

Рекомендации по теме
Комментарии
Автор

the explanation is more beautiful as like as yours lol I had scrolled away my search I just clicked this video to see ur face but I got the point pls make videos on data structure and algorithms with python

BalaguruS-zpqf
Автор

I literally visited various sites and watched various videos but the only video where I got my concept clear regarding level order traversing was yours. Please keep uploading more 🙂

vidhushekhar
Автор

Deepti, I must say I've been following your video solutions for while now and they are great and they helped me a lot! Looking forward to more of these videos.👍

vedantbhenia
Автор

@ DEEPTI TALESRA Very clear and concise !Thank you!

architectsmusicgroup
Автор

dude your video just helped me Cleared this concept. precise and clear implementation.

jatingoyal
Автор

Definately one of the best leecode explanation!!!!

nchou
Автор

Very Clear and Concise explaination Deepti . Keep doing great work .

lakshitjain
Автор

After watching you i mean this video, my interest in python increases

rdcalwrth
Автор

You are just amazing Deepti! And an inspiration for many!

rparmar
Автор

I love the walkthroughs at the end please keep doing them <333

dimakavetskyy
Автор

omg i have been struggling for this question whole day until I saw your video, T T thank you so much!

fornoreason___
Автор

Thank you TALESRA .nice explanation in detail and walking through step by step of the code at the last several minute ! what about using Deque in this question ? It would nice if if record video as deque for this question .

timlee
Автор

Wonderful explanation! Thanks :)
Althought the entire space complexity narrows down to O(n), I see that you are utilizing 2 queues - Don't you think we can eliminate next_queue and handle everything in queue=[] itself by popping the visited nodes?

saiavinashduddupudi
Автор

Awesome explanation 😍😍, trying to understand this since last 3 days, now i m confident enough !!!! print("HAPPY")
🤣

ROHITKUMAR-tzvj
Автор

Good Work Deepthi
Your Explanation is Spot On
Lots of Love ❤️

sharankarchella
Автор

Great explanation. Thanks, will you please upload video on post order traversal using iterative approach

sharifmansuri
Автор

Thank you a lot you are the best, i like your style of debugging at the end best leetcode content keep goingg!!!

godza
Автор

Holy shit I understand now. Thanks so much that was a very clear explanation!

tweede
Автор

Hi TALESRA, thank you for the great and clear explanation.
I want to ask you how do you come out with this solution? And why do you name the variables queue and next_queue?
Thank you for reading my questions!

nonalcoho
Автор

Amazing explanation. Thank you so much !! 😀

eileenkuo