Level Order Traversal of a Binary Tree (level by level and as a whole)

[@xiangwingrace8672]

Amazing great algorithms !!!Thank you for posting this. Awesome video as always. Keep up the good work!!

[@ayushvats1808]

🔥🔥 the best part is u actually explained so calmly like one by one. and explained how the output is actually coming with that algorithm for all cases if anything will be explained like this.. concepts gonna so easy

[@pramodsable4482]

Awesome Teaching Sir... You made algorithms subject easy to understand. I will be always grateful to you.

[@columbiars]

Excellent explanation Vivekanand!

[@juhimittal3320]

love the way you are explaining the things, best ds tutorials

[@lresleland4238]

thank you for step by step instructions. Makes a big difference in understanding until the end!

[@sejalrathore7080]

Amazing explanation sir. Really liked it👍👍🥳🥳

[@programming_and_snacks5192]

Thank you sooo much man! No matter what anyone says you are awesome and the way you make things clear is amazing. Thanks again :)

[@suchitrakunnath232]

Program using above algorithm: public static void LevelOrderTrversal(TreeNode root) { Queue q = new LinkedList(); q.add(root); q.add(null); int level = 1; while(!q.isEmpty()) { TreeNode temp = q.remove(); if(temp != null) { System.out.println("Level = " + level + " value = " +temp.val); if(temp.left != null) q.add(temp.left); if(temp.right != null) q.add(temp.right); } else { if(q.peek() == null) break; q.add(null); level++; } } }

[@kirandhedhi2612]

hats off keep it up and upload videos in same manner!! thanks a lot!!

[@kirandhedhi2612]

sir where is the code?

[@Ankit-hs9nb]

github.com/mission-peace/interview/blob/master/src/com/interview/tree/LevelOrderTraversal.java#L19

[@m4riders]

Very well explained sir

[@smn656]

Thanks for the great explanation Vivekanand.

[@dimpleshah3037]

Superb explanation

[@kasyapdharanikota8570]

very well explained. Thank you sir .

[@AvinashKumar-uz9fq]

what will be the looping condition in line by line? If it's loop till queue is not empty then in the if condition p ==null, n the enqueue statement under it will make an infinite loop.

[@coderix1404]

Awesome explanation

[@vikashkumarchaurasia1299]

Outstanding explanation

[@sweekriteesingh518]

Very nicely explained 👍

[@himansuranjanmallick16]

Awsome logic bro👌

[@VirendraSingh-hd9yr]

thankyou sir for awesome explation

[@omrajpurkar]

Nice Explanation!! Thank you 🙏

[@ashishg656]

do you provide live coaching for interview preparation. ?

[@ArunKumar-wy8qv]

Thankx sir, So level order traversal and BFS is same ?

[@malkitsaggu]

Great explanation.

[@xCwieCHRISx]

Now I did understand the algorithm on wikipedia. Thank you.

[@abhisheksaxena6413]

great explaination ... i was struggling to understand this

[@vivekanandkhyade]

Glad to help you.

[@nitinsridhar7555]

Who is your guru? Great explaination...!

[@ryan-bo2xi]

You are awesome brother. Better than G* i should say !

[@vivektyson]

Awesome Sir

[@sandeepmunavalli6345]

Very Nice and clear explanation sir :)

[@prasannachalgeri7152]

Awesome Videos!! I still think there are many missing like finding max element in binary tree using recursion and without recursion which indeed uses LOT. Can you also try to make videos on those topics

[@kkbh4263]

Clear and crisp explanation. But do it with code.

[@dan-nm2tg]

very clear to understand .thanks

[@sachinsingh-jg9lx]

Hats Off Buddy....

[@tyler_ua6593]

How can I store each level into an ArrayList? Not just printing them all sequential out.

[@tyler_ua6593]

For everybody who is seeking for the same answer. Here is the link:bit.ly/2HmIOm8

[@paligamy93]

What's your return type look like?

[@biplabsarkar4827]

great explanation sir

[@ashishg656]

great video sir, thanks a lot

[@preetamvarun9219]

Man you're awesome seriously

[@shanikumar2019]

You are awesome,Dear

[@tapanjeetroy8266]

Thank you sir

[@Vishal-ng2xb]

Hi ..very good explanation..but for left and right view how do I determine the node?for left view maybe the 1st node after each null..but for right view?

[@milimishra6447]

for right view it will be the end node at each level...

[@RANJANJHA95]

Using level by level (not in one line) For the left view: the first root node and then each node just after null. For left view: Any node just before null

[@sudamkalpage8107]

thank you!

[@amd7407]

Thanks a lot for the video

[@HebaHabashkpoper]

thank you so much

[@srilekha9177]

Excellent explanation. Mention the codes also. It would be useful.

[@arun26cs]

thank you much vivek!!!!

[@HouseJunkieHUN]

Thank you, Sir!

[@keyurshah5203]

its really good

[@taranjitsingh1115]

great work, man! cheers!

[@surajne2419]

Good job Bro. Keep it up :)

[@himanshusattavan1335]

wonderful

[@prakashraj2411]

osm. explanation

[@jingli2168]

Hope this help, but there is another simple version. # None version def horizon_level(root): if root is None: return queue = [] queue.append(root) queue.append(None) while len(queue) != 1: p = queue.pop(0) if p is not None: print(p.data) if p.left is not None: queue.append(p.left) if p.right is not None: queue.append(p.right) else: queue.append(None) return

[@user-uh4be8ci7i]

thx

[@NaRuCHi-ch]

thank you so much !!!!

[@Developer.786]

thank u

[@moayyadarz2965]

really it is amazing and outstanding explanation If we want to communicate with you how can we do that ? we ,a group of students from turkey ,want to take a paid course online from you hopefully you could help us all the best

[@DeepakPandey]

Hi @vivekanand thanks for explanatory videos. Could you please cover trie data structures and there applications. Thanks in advance !

[@Vishal-ng2xb]

How do I check for consecutive null

[@sunitshrivastava4448]

inside if loop, check for next element of queue to be null and break out of while loop.

[@jingli2168]

check the length of the queue if len == 1 then stop the while loop, cause only None in the queue

[@tanzeemahmed9774]

Great video. Do you have code sample?

[@Ankit-hs9nb]

github.com/mission-peace/interview/blob/master/src/com/interview/tree/LevelOrderTraversal.java#L19

[@Bakepichai]

superb.... :)

[@i_amsinha]

If the tree node has value of type "int" , the Null solution for line by line traversal isn't gonna work.

[@talal194]

You can enqueue -1 then

[@ramakrishnakcr4417]

❤️

[@anandkulkarni2111]

There is much better and simple way to print level by level using recursive call collect items into map and then iterate level by level to print them

[@HumbleMan78]

In case recursive function call is expensive , this method is suitable. The extra Queue memory is actually O(n) which is very less

[@tusharsingh6792]

will u please implement the same in code

[@DentrifixoRam88]

great job!

[@noureenislam7691]

where do i find the code?

[@raj-nq8ke]

(Dequeue Print Enqueue ) untill queue is empty.

[@milimishra6447]

nice..

[@paraskumar693]

This is vey High Lebel thinking

[@VISHALSHARMA-mu9kl]

sir plzz also provide code for this

[@ArpitDhamija]

Iska code.....

[@brahmam9842]

Everything is Good.Improve English Bro.(Just suggestion)

[@arvindkumarsharma5536]

What's wrong about his English?

[@sachinsingh-jg9lx]

Explained logic is crystal clear.....He wouldn't be working for BPO.

[@jaysahu357]

thank you sir

[@vivekanandkhyade]

Welcome Jayram,