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

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.

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

Every videos has 110% of good explanation.

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?

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 😇

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!

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

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?

thanks, very comprehensible!!

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

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

😃😃😃😃😃😃😃😃😃

Thanks

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