Invert a binary tree | Leetcode 226 | Easy | C++ | Code + Explanation

[@venkatakalyan4953]

As usual great explanation.

[@PrinceSingh-rs4ed]

Wow, that was an easy and straight forward explanation

[@SapanaDashoni-n1o]

Great explanation!!!

[@Idukhan-jj9kc]

I heartily appreciate you well done

[@reshmaparveen6679]

Ma'am u r great yr teachings capacity is osm

[@KhaiVoHoang-e5s]

Your video is so helping

[@Fahadpro0123]

Learning something new

[@abhaythakur2597]

nicely explained

[@vedicacademy4128]

Thank You Mam

[@chaitanyakarthikbasva]

For those asking java implementation, class Solution { public void invert(TreeNode root){ if(root == null){ return; } invert(root.left); invert(root.right); TreeNode temp = root.left; root.left = root.right; root.right = temp; } public TreeNode invertTree(TreeNode root) { invert(root); return root; } } once, you understand the logic, it should be easier for you to implement the solution, you may fail in the beginning but be persistent you will emerge glorious! JAI HIND, JAI BHARAT!!

[@devesh096]

Thank you Alisha, It would be great if you also write code in Java.

[@AkashYadav-po5kb]

It would be great if you see someone else video 😅