Invert Binary Tree (LeetCode 226) | Full solution with diagrams and animations | Study Algorithms

[@ashok2089]

Others: Let's explain recursive approach, done. Nikhil: also explains BFS approach! That's why you are a gem!

[@kanaramjangid8563]

Every videos has 110% of good explanation.

[@nikoo28]

Glad you like them!

[@glaide1500]

Man : On all your series, you tried !!! ... Thank you so much as you continue to saves life.

[@TamilarasiM-gs8fb]

Thank you so much .After a long search I got clearly explained video

[@minnikeswarrao6185]

Hi sir, First of all big fan of your work🙌 Requesting you to solve "Sum of distances in tree" problem of leetcode... I have gone through many videos but none of them are clear... Looking forward for your explanation 😇

[@fortunefunda4171]

Sir at 13:42 you added 2 and 7 to the Queue but shouldn't 7 and 2 be added to Queue because you did swapping before this . I really liked your explanation but having this little doubt. Please clear this minor doubt.

[@garvitarora7777]

yes you are right

[@nikoo28]

Yep…sorry for the confusion

[@anushkamathur4050]

Why are there so less likes on this video, this is so informative. I have seen more likes on stupid content and this quality content is getting lesser likes. Great work Nikhil Bhiaya!

[@susmitapatil4847]

Very well explained. Thank you so much for such nice content 🎉

[@nikoo28]

My pleasure 😊

[@quanganh7094]

thanks, very comprehensible!!

[@lemui2075]

Thank you so much for video with explaination. May I check with you, why you put the keyword "final" in front of Queue ?

[@nikoo28]

you can remove the "final" keyword if you like. It is not necessary in this implementation. :)

[@anirudhv0062]

why is the Linked List implementation of the queue being used here? can we use other thing like deque or other implementation of queue also?

[@nikoo28]

Yes

[@anirudhv0062]

@@nikoo28 Thanks! Your explanations are awesome

[@subee128]

Thanks

[@evadranuvvuu]

if(root == null) { return null; } TreeNode temp=root.left; root.left=root.right; root.right=temp; invertTree(root.left); invertTree(root.right); return root; Sir this one take o(1)space? Then why using queue sir? Please any one explain?

[@ascreations1396]

😃😃😃😃😃😃😃😃😃