Level Order Traversal of Binary Tree

Program to print tree in level order fashion.
github.com/mis...
github.com/mis...

[@Kgp-ty5dk]

your tutorials have been immensely helpful for me for the last 20 days. you have made my coding learning easier. thank you Sir

[@aadarshgupta4309]

Seen Many videos on it but your Explanation is very easy . Finally I understand this concept

[@inspired_enough_to_grow_up]

Its great that you are using java for explaining the algorithms...

[@Farrukhw]

Waooo, what a simplicity ... Thanks a bunch .. Regards from Pakistan

[@BRBallin1]

Great explanation. In Leetcode, it wants a way to do this where each level is stored in a separate list

[@thesaloniguptaa]

You can add NULL before while loop in the queue and check the condition whether the null is present or not, if it is present, print new line and add another NULL inside the queue.

[@em_ashutosh]

@@thesaloniguptaa and keep a check on while condition now it should be while(q.size()>1)

[@falakk22]

Thanks for showing step by step flow .. You have spread light of your hard work to all , More power to you !!

[@PrathamMantri]

Thank You Tushar sir, Its helping me for my interview preparation with companies mostly concerned with DS and algo. Do you have any tips for preparation, do share please!!

[@hasanozdemir1067]

Great explanation! Thank you.

[@varunkrreddyyenumula2935]

Thank you bro :) Excellent explaination... keep on uploading different ways of approach to solve different problems

[@abhay6124]

I have gone through many videos but you make very easy

[@vasachisenjubean5944]

Best explanation so far

[@aravind.a]

Best explanation of BST Level order traversal :) keep rocking bro :)

[@ngbtvezadtht]

This video is about binary trees, not binary search trees. In the examples he shows, the nodes are not necessarily in increasing order.

[@umangsharma9423]

@@ngbtvezadtht doesn't matter its a binary tree or a BST this algo will work for both the DS.

[@asharafalikhan5287]

Your video helped me... thank-you

[@piyushsharma1638]

Thank you so much for easy explanation.

[@abdremo]

thank you bro

[@ridimamittal4064]

Thank you sir : )

[@ridimamittal4064]

Thank you so much !!!

[@elyoaprogrammer]

Great Tutorial!! Thank you

[@sachinyadav9520]

nice explanation.thanks

[@abhay6124]

Very effective way

[@xof8256]

THanks

[@NovjeanJohnK]

nicely done

[@Emfanever]

Good explanation, thx

[@incrediShorts]

another great tutorial...are you a professor or you do this in spare time??

[@iviivanovicilic]

This video is great! I am wondering, are you studying computer science?

[@dholni]

can you give c++ code or pseduocode for functions 1)ADD (at end level order) Heap up, 2)Remove(from root) heap down. thanks

[@jitendrapandey176]

Thanks for such a nice and comprehensive tutorial sir. I request you if you can upload "Graph Data Structure" videos as well including graph traversal algorithms like Prim's algorithm, Kruskal's algorithm, many more. There are many videos on KZbin on Graph topic but I didn't find any with programs(code). So if you find some time, please make videos on these. Regards...

[@jitendrapandey176]

Ok...thanks I didn't notice that. Thank you 😊

[@countdooku681]

Great explanation. Thank you so much!