Invert Binary Tree | Day 1 | [ June LeetCoding Challenge ] [ Leetcode #226 ] [ 2020 ]

preview_player
Показать описание
The day 1 problem in June Leetcoding Challenge. ( Invert Binary Tree ).
Check out our other popular playlists:

Problem statement:
Invert a binary tree.

Example:

Input:

4
/ \
2 7
/ \ / \
1 3 6 9
Output:

4
/ \
7 2
/ \ / \
9 6 3 1

If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful.

#coding #leetcode #softwareengineering #algorithmsMadeEasy
Рекомендации по теме
Комментарии
Автор

I hope you all are enjoying the June leetcoding challenge!!! Don't forget to leave a comment!!! Please like the video to support us!!!
Struggling in a question??
Leave in a comment and we will make a video!!!🙂🙂🙂

AlgorithmsMadeEasy
Автор

YOU HAVE NO IDEA HOW CONFUSED I WAS. thank you thank you thank you.

AnaGuerra
Автор

Nice. Straight to the point. In very short time explained very well!
Subscribed!

kirankumbhar
Автор

Can u explain how u are recursively calling the same function till the object is null.
I didn't understand that part
Can u explain it with some other example besides this question
I want to know how its working that way. Plz explain

ryzen