Binary tree: Level Order Traversal

[@tweede5555]

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

[@seabass7615]

10 years for me now lol

[@jervx829]

@@seabass7615 how many experience do you have in dev? Me just graduated, but still going back here because too much learning frameworks kinda forgot how this work lmao

[@seabass7615]

@@jervx829 Im a sophomore in college for CS right now. I just meant that this 10 year old video still really helped me.

[@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!

[@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

[@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...

[@on_a_grind_rn]

Its incredible how relevant these videos are even after a decade. Absolute respect to the creator.

[@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.

[@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.

[@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

[@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

[@Huehhee7777]

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

[@ajaygunalan1995]

9 years later, this is still, gold!

[@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 :)

[@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

[@AlexanderMcNulty92]

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

[@vaibhavtiwari6540]

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

[@zondidlaw2195]

man i have a PhD in CS and a founder of it, love your videos man, clear explanations

[@nitinjaiman]

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

[@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

[@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

[@AvantikaShukla-b3p]

Finally found the best explanation of level order traversal

[@looppp]

mycodeschool is the best.

[@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!

[@honeyshihtzu9675]

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

[@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.

[@MJ-zs5jv]

I plunged into the way you explained. Love it.

[@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.

[@factwithhunny078]

True

[@anonnona6940]

Best explanation by far still after 8 years

[@Contemelia]

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

[@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; }

[@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

[@serenestrolls-d7b]

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.

[@sachinos]

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

[@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

[@MaxSharpy]

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!

[@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

[@camillesatoshi8393]

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

[@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

[@TangiralaVenkat]

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

[@saurabh2802]

this is so brilliantly explained

[@bilalbashir8361]

xplaining very lucidly snd clearing the doubts

[@DiamondDogGoPewPew]

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

[@TomLobato]

great class! tks! in 10:35, the max num of nodes in the deepest level is (n+1)/2, not n/2. Just noticed because I`m using a fixed size queue, so I had to calculate the max.

[@akshaypathange3582]

Tom Lobato he said at least

[@vijay6877]

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

[@ritikpatel3286]

One of the best explanation's out there!

[@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

[@jeetsharma1292]

Awesome ...simple and yet so advanced!

[@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 :)

[@MrNiceone99]

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

[@MJ-zs5jv]

These videos are really great to mayhem the fear of non-linear DS.

[@mursalinhabib1156]

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

[@Cassandra81552]

The best explanation ever, thanks a lot!

[@goldymarizlunesa8719]

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

[@11m0]

Seriously, do you have a patreon or a donation link. I want to show my appreciation for what you've done for me by posting these videos

[@kyssl]

Victor Oben he's at Google/Microsoft now

[@theFifthMountain123]

Disable adBlocks for his videos and if possible click on advertiser links.

[@JackSparrow-bx8oo]

He died in road accident

[@anveshreddypinnapareddy3552]

@@JackSparrow-bx8oo Nah, that's not him. His friend, co-founder of mycodeschool died in a road accident.

[@jonathanharoun5247]

This is actually mind blowing

[@DurgaGuntoju]

Nice Explanation. You should explain the Tricky Part here. Output should be level wise. Means, E DJ BEGK ACI H

[@ashwinimishra4097]

this is the the best way to learn new things .

[@josnoordzij6802]

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

[@26411bapul]

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

[@nigannayak2139]

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

[@austinbvi]

Can't thank you enough for this playlist!

[@fury2613]

Probably the only Indian who makes such good videos on programming!

[@MCrown]

You are the best! Thanks for so clear explanation

[@hhammash]

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

[@kunalsoni7681]

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

[@dawkinsjh]

Super clear explanation of this!

[@snehill7275]

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

[@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

[@CautiousCrow]

Concise and well explained. You're amazing!

[@PriyanshulGovil]

You need to come back, I'm not even kidding!

[@zoumzoumzou]

Great explanations ! it's sad to see that the website is offline :( hopefully you moved on to some other great stuff

[@honeyshihtzu9675]

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

[@govindkothari7989]

queue test; void levelorder() { test.push(root); while(!test.empty()) { struct node* temp = test.front(); cout info left) test.push(temp->left); if(temp->right) test.push(temp->right); test.pop(); } } // it will work fine

[@paragkarguppikar9006]

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

[@AwaraGhumakkad]

Amazing way of explaining :)

[@Qweertt-y4r]

your explanation is on the next level man. but anyone who can help me with the java code of these.

[@parthshah6343]

Why are we doing queue instead of just queue can anyone please explain?

[@elishaalibakhsh7393]

You saved me one more time. Thanks

[@vithushanjegatheeswaran5317]

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

[@axelramirezlinarez7449]

Incredible quality of videos, amazing work!

[@caseysick2154]

Great video and explanation. could just be instead of popping it after pushing. Thank you.

[@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

[@tapanachary2348]

Wow , mind blowing explanation , thank you so much

[@kyzuno5066]

God damn it. You are so great at teaching, my tuition should have gone to you instead of my professor.

[@simplymade7802]

Sir your voice and accent and of course your teaching is amazing...frm where do uh belong sr??

[@San_Jan_]

Very clean explanation🙂

[@memofahood4543]

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

[@kartikxramesh]

Great solution, I paused the video after seeing the question, and tried t solve it myself. Here how i was able to solve it using recursion. void printTree(Node* root){ static int flag = 1; //don't be confused about flag i'm only using it because otherwise every node except the if(!root) //original root node was printing twice return; if(flag){ cout

[@tanishkagupta6931]

Please make videos on AVL, RB trees, and prominent algos as soon as possible!

[@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

[@deepeshrathi3408]

Travelling in level order with the help of recursion is quite easy than that of while loop

[@dallasdominguez2224]

Love watching these videos. Theyre like little brain logic puzzles.

[@HeyMr.OO7]

Legendary.. Simply Legendary 👍🏻

[@roliverma4483]

You make it all so simple :) Thankyou so much

[@PiyushJain01]

excellent video of preorder , postorder and inorder . this video cleared my all douts but i will become more better if you also explain algorithm of them. so please provide algo. of them

[@harshithvb1]

I like your videos very much. Very simple and straight forward explanation. Thank you.

[@prats22]

Watching after 10 years

[@DMDRPBHU]

i rarely comment but you are a legendddddddddddd

[@sbond_0077]

Thank you is a small word! Keep recording.

[@goelshubham46]

by the logic u were using,q.pop() should come in the second line of the while loop not in the end.

[@rbsupercool]

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

[@anirvansen2941]

Python Implementation: def level_order_traversal(self): if not self.root: return -1 else: queue = [] queue.append(self.root) while len(queue) != 0: popped = queue.pop(0) print(popped.data,end=" ") if popped.left: queue.append(popped.left) if popped.right: queue.append(popped.right)

[@MegaPaloma1988]

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

[@ivlog4955]

Legendary explanation