Level Order Traversal Binary Tree | Binary Tree Level Order Traversal | DSAOne Course #59

[@gouravchouhan1790]

That null wala funda was genius 😘😘, If I were to do that, that would be trash and some kind of jugad, yours was elegant and now it's mine cause it wasn't yours either and maybe it was, it doesn't matter, that's how all this works, good things are always appreciated ❤️

[@divyrajverma8286]

हर हर महादेव जय माँ भवानी जय श्रीराम जय माँ सीता जय हनुमानजी 🙏🙏🙏🙏🙏❤❤❤❤❤❤🚩🚩🚩🚩🚩🚩🚩🚩🚩🚩🚩🚩🚩

[@rosonerri-faithful]

Anuj Bhaiya is the most genius coder in YT along with Aditya bhaiya. I have never walked off from their videos feeling disappointed. The null approach intuition is solid!

[@shreyashpatil4196]

I understood it in 2 min thank you 😅😊

[@carry_still_live]

thanks a lot bhaiya for making such kind of content for free. Before watching this video I was so confused in level order traversal but now I can explain and do code of level order blindly . Again Thanks a lot ❤❤❤

[@funcode-tw3cg]

thanks for clearing my concepts on level order traversal bhaiya !

[@shalumishra662]

Bhaiya you are literally a genius. i had learnt a lot from you .I wish i could give your video more than one like😂.thanks for teaching and please make more problems solving videos of DSA topics😐

[@anshpandey14325]

Makes it super easy . Thank-you sir

[@AmitPrasadbangalore]

Anuj Bhai, You are doing great. Keep it up brother

[@modalauday5938]

Thanks to Anuj bhaiya for this course 🥰🥰

[@lalitkashyap8167]

bhaiya your way of teaching is so next well,so pls try to make the course complete ....it will help so many students

[@rohitmaurya5931]

amazing yrr bhaiya ,your teaching skill is superb

[@khageshbansal2400]

Best teacher.

[@ayushigupta8633]

Very Well Explained, Thanks a lot

[@ashutoshsharma5912]

Sir this video was really helpful for me....thank you so much sir 🙏😊

[@snehakaur8946]

amazing lecture 🙌

[@upskill-development]

Your contents are awesome please post videos in English

[@balavardhanreddy8581]

You are real guru bro❣❣❣❣❣❣❣

[@sarwat3552]

Neat and easy explanation!

[@bpratikvinod8110]

Samjha bhai samjh gaya 🤟

[@sumairakiduniya7976]

good and awesome video

[@kunalkheeva]

Thank you it makes sense now.

[@prajwalshetti9367]

Please upload at least 2 videos per week

[@fardilviews]

love from Bangladesh.

[@Ganesh-zo9vr]

keep going bhaiyya

[@pradip_patil292]

Great!

[@arpanmaheshwari2290]

Bhaiya is Back😀😀😀😀😀

[@ManishKumar-ss4ks]

brother , thanks

[@AnujBhaiya]

You're welcome!

[@dipanshusingh]

Great vid bro. ♥

[@senseiKakashi07]

thank you bhaiya 😁

[@nirmesh44]

awesome way of teaching. great work

[@smit7688]

Thanks amazing video

[@lokendrasingh9780]

Thank you bhaiya🙏👌

[@manshushivam295]

Bhaiya me Bhaiya ....Anuj Bhaiya!!!

[@reenayadav8468]

One week main 3 video dalo bhaiya

[@nitishsingh3470]

Yes very easy explanation

[@ayushmishra3340]

bhaiya in the naive solution how to decide how many levels will be there in the tree so that we can run a for loop up to that?

[@shubhampatil4631]

bhai kdk yaar

[@toshalchaudhari6574]

Nice explanation..

[@prannoyroy5312]

This was a more difficult topic than ones before. But still very well explained.

[@nageshpoojary271]

nice explanation.. doing good job.

[@hhcdghjjgsdrt235]

u r da bst

[@adityamore7471]

The method isEmpty() is undefined for the type Queue how to fix this

[@ANSHULGUPTA880]

First method with O(n^2) is printing 7 and 9 first...so its going from bottom to up...! While queue method is printing from top to bottom.

[@fireblade987]

is the breath first traversal? or depth first? or none?

[@pinkkitty6553]

bhaiya isme ek for loop bi ayega na for(int i = 0 ; i < queue.size() ; i++)

[@shashwatkrishnashukla2284]

OP teacher

[@rohitmore7725]

i am beginner to coding ,did anybody implemented this in hash map way which Anuj bhaiya explained in last

[@nabihamalik2212]

What is the recursive relation of level order traversal in form of T(n)?

[@bossagent5010]

if the queue is implemented with linked list then how will you handle the null node case (for every new line)

[@subhajitmohanty8349]

Hi bhaiya

[@mranjaan5193]

So yeh aao ka dsa course java pe based hai??

[@ajoysahu2998]

Is it possible to have binary tree where its left node is greater than itself... in your example (Time: 6:06) node with value "1" has a left child with value "2"?? BTW, I really like your explanations.. the way you cover the problem & come to a solution

[@10daysAgo]

It's not a binary search tree . 👍

[@sarwat3552]

possible for such trees

[@bhumikagupta1268]

first of all, drop your hair care routine.

[@PurbaChakraborty-um8wt]

For the recursive application the code is correct.. But i think not the explanation

[@chauhansumit5486]

Full stack developer full roadmap banaye na please sir please

[@amitmohapatra6022]

Sir, I have gone through the tree concept and even watched your last 3 videos of tree and understood the approach and algorithm used to solve the various traversals and finding height, max node of tree.
Still I am unable to take any new question on tree and solve it by my own.
Please help me if somewhere I am lacking??
I will appreciate your response.

[@shashankmarri1056]

Hey Amit, it is a common thing that happens to everybody. All you need is to keep practicing more. Slowly you will be able to solve these kind of problems independently. Data Structures and algorithms are the most difficult part, just keep practcing.

[@Lifeofkashh31]

greattttttttttttt

[@nihalshah3572]

Bhai Android development in Java please
All those how want give like 👍

[@DurgaShiva7574]

i think the recursive solution wasn't correct, as we did a print for data ONLY when the level was 1, but what for other elements... there we didnt wrote any condition nor did we printed anything.. please correct me if i a am wrong.

[@nageshpoojary271]

logic of recursive solution is right.. because for the original root of tree required level is given as input.. eg(level 3).. level value decrease recursively and when it reaches level 1 pointer will be pointing to the required level element..

[@DurgaShiva7574]

@@nageshpoojary271 got it.. thank you

[@nittinrana2277]

❤️❤️

[@MrSourabhkumarjain]

with hashmap and arraylist
public void levelorder(Node root,Map m, Integer level)
{
if(root== null)
{
return;
}
if(m.containsKey(level))
{
ArrayList l = (ArrayList) m.get(level);
l.add(root.data);
}
else
{
ArrayList l = new ArrayList();
l.add(root.data);
m.put(level,l);
}

System.out.print(root.data+ " ");

levelordermy(root.left,m,level+1);
levelordermy(root.right,m,level+1);

}

[@4FALLEN8]

Actually it's not queue I think ,it's stack , you are pushing and piping from front.

[@AnujBhaiya]

Pushing at the back, popping from front. It is a queue.

[@4FALLEN8]

😅 ,oh right, I got confused from the code😅.

[@MitraWithUSA]

Isn't level order bfs?

[@karanransing9755]

Yep

[@sridharanv5841]

No translation here?

[@MrTabraiz961]

Try this for HEIGHT calculation
public int height(Node root)
{
if(root == null){
return 0;
}
return (height(root.left) + 1) > (height(root.right)+1) ? (height(root.left) + 1) : (height(root.right) + 1);
}
thank me later

[@KamleshSingh-ym3cl]

java code using queue-
input- [3,9,20,null,null,15,7]
Output
[[3],[9,20],[15,7]]
/*...........................................................................................*/
class Solution {
public List levelOrder(TreeNode root) {
List result= new ArrayList();
if(root==null) return result;
Queue queue= new LinkedList();
queue.add(root);
while(!queue.isEmpty()){
List level= new ArrayList();
int count= queue.size();
for(int i=0;i

[@krishnadawalkar6999]

❤❤