Binary tree: Level Order Traversal

See complete series on data structures here:
• Data structures
In this lesson, we have discussed level order traversal algorithm for binary tree.
See source code here:
gist.github.com/mycodeschool/...
For practice problems and more, visit: www.mycodeschool.com
Like us on Facebook: / mycodeschool
Follow us on twitter: / mycodeschool

[@slayerq3]

You are doing god's work, seriously...This is the only place I've learned sorting algorithms, trees, linked lists, everything related to my syllabus. I should be paying you instead of my college :P

[@AlexanderMcNulty92]

Sad but true. His code is so much cleaner than anything in the books.

[@nikhilbalwani2285]

LOL. Donate generously to mycodeschool.

[@vincentlavello3499]

I totally agree. Thanks for this. I will be donating - wish I could get my tuition refunded and donate it here.

[@adityaojha2701]

Man even 4 years later this is the best playlist on DS.

[@abdelrhmanahmed1378]

@@adityaojha2701 true its the best in the entire world wide web and even among university prof

[@jeppojeps]

man, I have a PhD in CS, your work is outstanding, it's a great effort to make things clear and accessible to anyone

[@betrp]

BTW why are you watching this

[@BharathKumarSampath]

😂 curious to know

[@mohandas3212]

@@betrp 😂💯

[@DangThinh261]

Add friend me 🥲

[@jackmiller2518]

just had to tell us about your PhD didnt you

[@tweede5555]

6 years later, and this still helped understand. Concepts are truly timeless!

[@seabass7615]

10 years for me now lol

[@jonathanlim2269]

I've grown to be a fan of your videos - they're my first stop for any question or concept I need to clarify on programming!

[@mycodeschool]

Jonathan Lim Thanks a lot :)

[@amateurbeginner7538]

why do we need current in this example ? :)

[@schizophrenicleo3036]

@@mycodeschool Have you guys moved somewhere? Where is the website? There are not new videos from the past three years as well :(

[@sravanthkumarchintalacheru1359]

@@schizophrenicleo3036 From the comment sections and the news, I learned that the creator of this channel died in a road accident :( He's famous in programming community as Humble Fool

[@schizophrenicleo3036]

@@sravanthkumarchintalacheru1359 Oh , I am sorry. Didn't know that. He was indeed making wonderful videos though.

[@chia-juchen8246]

I remember watching your video in linked list for my data structure assignment as a freshman, now I am already studying CS master in the US and start watching your video again for preparing coding interviews! Sir, you're awesome! very clear explanation and easy to follow!

[@Srinivasssssss]

This video is almost 9 years ago, but still this video it is the best explaination for level order traversal...(for me) Thank you so much sir...

[@nitinjaiman]

dude you are really good in teaching. i went through almost all your videos now i feel really confident in these topics

[@pitchaiahsoma5295]

You are the best teacher with a perfect tone of gifted voice and providing clear explanations about what is happening in memory. These fundamentals would be stamped into our memory easily. Please keep up the great job extending videos to new topics.

[@sr3281]

I always check your videos for a quick, concise and clear explanation of anything I want to learn. Your channels the channel I check for first when I search youtube for tech videos. Thank you very much

[@mycodeschool]

Poyo Boy - A pointer variable always stores an address. For the definition of Node in this lesson, if I have a pointer to current node in a variable named current, then current will give me the address of that node ,,, current->left will give me address of left child and current->right will give me address of right child. Did you watch previous lessons on tree in this series? They should make things clear for you. Data structures: Introduction to Trees

[@truongvanloc8275]

Do we use stack for other binary tree traversal algorithm: PreOder,InOder,PostOder?

[@truongvanloc8275]

void PreOrder(struct Node *root){ if(root)//If root != NULL { printf("%d ",root->data); PreOrder(root->left); PreOrder(root->right); } }

[@ramk9953]

yes bro we are using stack(implicitly) .but ,it takes place in application memory stack

[@sunnysidesounds]

Excellent, this was extremely helpful to visually see the level order traversal. I have been having trouble with other examples visually seeing what was happening and this cleared it up greatly. Thank you!

[@AlexanderMcNulty92]

Your channel has officially earned my trust. I will recommend anyone interested in basic data structures to come here.

[@jamisongriffith6308]

Incredibly helpful! The theoretical lesson was excellent. The code walkthrough was hard to follow, but you did such a good job at teaching with diagrams that the walkthrough wasn't necessary.

[@jessg7144]

Truly ... Thank You. I love your visual , they always help me understand the concepts.Clear and understandable. Awesome!

[@eddyateye810]

wow, this guy is huge with explanation... keep it up. have been looking for explanation for this but I think i discovered more than i wanted... bless you guy

[@mycodeschool]

Next Lesson: - Binary tree traversal: Preorder, Inorder, Postorder

[@rohit2761]

+mycodeschool okay babu

[@amateurbeginner7538]

GOD bless you , you are the best teacher i have ever seen :) great attitude, clear explanation and organized material :)

[@CautiousCrow]

Concise and well explained. You're amazing!

[@noumanmalik960]

Sir I cant thank enough ,You made me understand all the concepts and I will promote your channel in whatever way I can. Thank you

[@looppp]

mycodeschool is the best.

[@MJ-zs5jv]

I plunged into the way you explained. Love it.

[@camillesatoshi8393]

Again, your explanations have the right depth and keeps complete ! Thank you for the great content!🤓

[@ritikpatel3286]

One of the best explanation's out there!

[@axelramirezlinarez7449]

Incredible quality of videos, amazing work!

[@austinbvi]

Can't thank you enough for this playlist!

[@Contemelia]

My prof took 53 minutes. You took 38 seconds. Thanks a lot man :)

[@sachinos]

it's big art of having such kind of wonderful explanation.. this remember me all MIT university video...

[@jcvandermerwe5311]

I work in C# and this is the first time that I got a clear understanding about Level_Order_Traversing. Brilliant work.

[@madanmohan5661]

How the Fu*k should I print this, I understand all things that is taught in this video but I don't know how it will print the elements

[@lanternarasu6061]

@@madanmohan5661 Don't use curse words in educational videos

[@vaibhavtiwari6540]

Naming the enqueued as discovered nodes and dequeued as visited nodes makes it much more intuitive, thanks.

[@MCrown]

You are the best! Thanks for so clear explanation

[@honeyshihtzu9675]

Guys u r doing an awesome job.... wish it all happened a decade back...

[@goldymarizlunesa8719]

I love your videos! All very easy to comprehend and understand. Thank you very much.

[@jeetsharma1292]

Awesome ...simple and yet so advanced!

[@josnoordzij6802]

This helped me tremendously. Thank you very much. Great work!

[@martini9388]

Great video! Very usefull even after 9 years! Code explanation was so good, I had no problems in implementing it into JS and I dont even know any other programming language. Thank you Sir for your work!

[@harikrishna-io8sc]

I am shocked by seeing the explanation of code because it is crisp and neat and also easily understandable. Great work sir.Hope you to add Data structures interview questions on trees and linked lists with code

[@dawkinsjh]

Super clear explanation of this!

[@vishalraghav8982]

You got a really thorough knowledge, and you are getting way low audience than you deserve. i m trying to tell most of my friends to refer to your channel.

[@likithareddy4627]

youre really a kind hearted person. thanks for making such a nice and decent video. i want to like all you videos dude they are really upto mark

[@HK-no9wm]

I really wish that u taught at my university. My professor uploaded a bunch of code and told us to go figure it ourselves and that was his genuius idea of teaching.

[@MrNiceone99]

Bro you are doing a great job :) I am learning computer science just from videos. Thank you very much.

[@laveshchanchawat6983]

until now i seen many videos over the youtube but no one was capable to teach in easy and mannerful way then this,founded the bestest video after learning from many .THAnK you man.

[@madanmohan5661]

How should I print this, I understand all things that is taught in this video but I don't know how it will print the elements

[@anonnona6940]

Best explanation by far still after 8 years

[@amateurbeginner7538]

code in C: include include include include define MAX 10 struct BstNode{ int data; struct BstNode* left; struct BstNode* right; }; BstNode* arr[MAX]; int front = -1, rear = -1; bool isEmpty(){ return (front == -1 && rear == -1) ? true : false; } bool isFull(){ return (rear+1)%MAX == front ? true : false; } void enQueue(BstNode* x){ if(isFull()){ printf("queue is full "); return; } if(isEmpty()) front = rear = 0; else rear = (rear+1)%MAX; arr[rear] = x; } void deQueue(){ if(isEmpty()){ printf("queue is empty "); return; } else if(front == rear) front = rear = -1; else front = (front+1)%MAX; } BstNode* getNewNode(int d){ BstNode* newNode = (BstNode*)malloc(sizeof(BstNode)); newNode->data = d; newNode->left = newNode->right = NULL; return newNode; } BstNode* Insert(BstNode* root, int d){ BstNode* newNode = getNewNode(d); if(root == NULL){ root = newNode; } else if(d data){ root->left = Insert(root->left, d); } else root->right = Insert(root->right, d); return root; } void levelOrder(BstNode* root){ if(root == NULL) return; enQueue(root); while(!isEmpty()){ BstNode* current = arr[front]; deQueue(); printf("%d ", current->data); if(current->left != NULL) enQueue(current->left); if(current->right != NULL) enQueue(current->right); } } int main(){ BstNode* root = NULL; root = Insert(root,5); root = Insert(root,10); root = Insert(root,15); root = Insert(root,7); root = Insert(root,3); root = Insert(root,20); root = Insert(root,25); root = Insert(root,21); levelOrder(root); return 0; }

[@Cassandra81552]

The best explanation ever, thanks a lot!

[@sa25078]

Another great video from MyCodeSchool .Thank You for your existence.

[@madanmohan5661]

How should I print this, I understand all things that is taught in this video but I don't know how it will print the elements

[@mursalinhabib1156]

These guys are crazy amazing, You guys deserve a Turin prize!

[@hhammash]

Great job, your videos are awesome and your presentation method is very clear.

[@TangiralaVenkat]

Your videos are great sir it clearly explains what is there and helped me a lot Thank you sir Thank you very much

[@vithushanjegatheeswaran5317]

WOW nice tutorial + thank you for the 21:9 format the video fits on my ultrawide screen perfectly

[@bilalbashir8361]

xplaining very lucidly snd clearing the doubts

[@memofahood4543]

Thank you thank you thank you. Your explanation is so amazing. That helps me a lot

[@ajaygunalan1995]

9 years later, this is still, gold!

[@MegaPaloma1988]

Thank for the high level quality of the content .. keep doing ;)

[@snehill7275]

& here is your new folwr....concise and well explained. You're amazing! thankyou : )

[@jonathanharoun5247]

This is actually mind blowing

[@nigannayak2139]

videos are really helpful...they helped me a lot....thankyou sir and keep sharing this...

[@vijay6877]

I also love you like many others. after you explain the topic it look so easy and simple.

[@AwaraGhumakkad]

Amazing way of explaining :)

[@26411bapul]

This is called best and awesome way of teaching some one. You really deserve 1000 Million likes. :)

[@roliverma4483]

You make it all so simple :) Thankyou so much

[@daboren1547]

Thank You so Much! The best explanation ever!

[@San_Jan_]

Very clean explanation🙂

[@elishaalibakhsh7393]

You saved me one more time. Thanks

[@tapanachary2348]

Wow , mind blowing explanation , thank you so much

[@premalathak6748]

Thank you so much. Great source of learning.

[@kunalsoni7681]

sir seriously this presentation is greatly awesome.. i really learn too much.. thanks 😊😙☺

[@dir3mad]

Amazing work mate

[@paragkarguppikar9006]

just awesome.. u r better than all the professors out here :)

[@ardhyakumar2539]

I bet, anyone cannot find better teaching elsewhere, whether be it paid course or at university :), I am rarely a fan of someone but I've been your and your channel's fan for quite a long time :)

[@HeyMr.OO7]

Legendary.. Simply Legendary 👍🏻

[@andreaolexova2621]

Man you are great! Your videos saved my life! Thanks a lot :)

[@ashwinimishra4097]

this is the the best way to learn new things .

[@GauravSingh-ku5xy]

Very well explained.

[@danielarodriguez1967]

This was very clear, thank you!

[@amit5051088]

Amazing explanation, Superb job #mycodeschool

[@rbsupercool]

thank you very much again.. mycodeschool rocks.. i'm your biggest fan.. :)

[@jasneetsinghanand6761]

Very easy explanation! Thanks!

[@madanmohan5661]

How the Fu*k should I print this, I understand all things that is taught in this video but I don't know how it will print the elements

[@ivlog4955]

Legendary explanation

[@CHIchangching]

So good..........keep up good things man!

[@MiddleClassTalk]

you are the best....wish u have uploaded more videos

[@freedomformysyria]

thank you شكرا لك وجزاك الله خيرا

[@mukeshjangidwwe]

Great Its very helpful for beginners.

[@danishuddin9752]

Great great great explanation! Thank you sir!

[@madanmohan5661]

How the Fu*k should I print this, I understand all things that is taught in this video but I don't know how it will print the elements

[@henrikrynauw244]

Amazing explanantion !

[@breakunknown]

thanks a lot, simple and clear

[@kautukraj]

Very helpful!

[@JayasooryanKVpnr]

love your videos...Thanks a lot!!

[@hossamtolba948]

Really your are the best, every time I try to understand a concept you rock it. I hope you rest in peace you did very well

[@ishanpand3y]

This man is still alive actually one of the founders of MyCodeSchool Harsha S aka Humblefool has passed away. The man behind this voice, Animesh Nayan, is currently working at Google. You can search his name on Linkedin.

[@hossamtolba948]

Really sorry to say, RIP hamblefool. So why Nayan is no longer uploading videos, we miss his videos 😔

[@madanmohan5661]

How should I print this, I understand all things that is taught in this video but I don't know how it will print the elements

[@berna031]

thank you for your help

[@srichetaruj2590]

Superb!! thanks for helping :)

[@rohithm]

awesome explanation.....!

[@AnirudhSinghTomarBME]

Thank you so much for your lectures :))))

[@vigneshaigal]

Awesome videos. Thanks a lot

[@Hateburn]

This is amazing.

[@guptayash4]

Well Presented.! :D Thanks for the video.

[@rar000000000]

Very good tutorial. thank you

[@nandini-ec5xl]

thank you sir,its so helpful

[@christopherramos2210]

amazing video thank you !!

[@honeyshihtzu9675]

I refer ur videos for any doubts ... and seriously u guys should start planning to charge .... :)

[@FaizanKhan-qu7is]

Very mast explanation...