Level order traversal of Binary Tree | Step by step demo with example | Study Algorithms

preview_player
Показать описание
When you look at a binary tree, the first thing you might see is that each node is at a different height. This simply implies that you can traverse the tree level by level as well. For each level you go left to right, hence the element that is seen first should be processed first. Given this information we can take the help of a queue data structure to perform a level order traversal of binary tree. Watch this video to see a step by step procedure with a code sample written in JAVA.

Chapters:
00:00 - Intro
01:10 - What is level order traversal?
03:55 - Logic of level order traversal
09:32 - Dry-run of code
13:31 - Final Thoughts

📚 Links to topics I talk about in the video:

📖 Reference Books:

🎥 My Recording Gear:

💻 Get Social 💻

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

You're a real teacher. Thank you Dear.

mikedelta
Автор

Excellent! I was able to solve the Zig zag tree using this. Thanks a lot!

rajeshpaithari
Автор

Your explanation is the best on youtube

adhirajkar
Автор

I would recommend your videos for everyone who is learning DS on YouTube.
Your videos are well defined for beginners.
Thank you for your efforts. 🙏

omkardeshmukh
Автор

Woww! I have watched almost every video of top youtubers but can't get. Now I get it😍 Thank you sir

onelove
Автор

A Great Video Course! Thank you for explaining it in a clear way.

vchandra
Автор

Your explanation is really helpful. Thank you.

krutikadave
Автор

u r the best . thaNKS FOR EXISTING SIR . YOU HELPED ME NAIL IT

shlokagarwalentertainment
Автор

Hi bro! I recently started following your videos, they are really awesome the way you are explaining can make any noob to pro. More power and love to you bro keep growing bro❤

manakosam
Автор

nice video, can you do more about trees?

ionguzun