Handle
|
Score
|
|---|---|
| @Ibrahim Nash | 5761 |
| @blackshadows | 5715 |
| @akhayrutdinov | 5111 |
| @mb1973 | 4989 |
| @Quandray | 4944 |
| @saiujwal13083 | 4506 |
| @sanjay05 | 3762 |
| @marius_valentin_dragoi | 3516 |
| @sushant_a | 3459 |
| @verma_ji | 3341 |
| @KshamaGupta | 3318 |
| Complete Leaderboard | |
|
Handle
|
Score
|
| @aroranayan999 | 1083 |
| @bt8816103042 | 739 |
| @SherlockHolmes3 | 444 |
| @SHOAIBVIJAPURE | 430 |
| @codeantik | 429 |
| @shalinibhataniya1097 | 400 |
| @ShamaKhan1 | 392 |
| @neverevergiveup | 372 |
| @amrutakashikar2 | 355 |
| @murarry3625 | 350 |
| @mahlawatep | 349 |
| Complete Leaderboard | |
Given a Binary Tree, convert it into its mirror.
Example 1:
Input:
1
/ \
2 3
Output: 2 1 3
Explanation: The tree is
1 (mirror) 1
/ \ => / \
3 2 2 3
The inorder of mirror is 2 1 3
Example 2:
Input:
10
/ \
20 30
/ \
40 60
Output: 30 10 60 20 40
Explanation: The tree is
10 10
/ \ (mirror) / \
20 30 => 30 20
/ \ / \
40 60 60 40
The inroder traversal of mirror is
30 10 60 20 40.
Your Task:
Just complete the function mirror() that takes node as paramter and convert it into its mirror. The printing is done by the driver code only.
Expected Time Complexity: O(N).
Expected Auxiliary Space: O(Height of the Tree).
Constraints:
1 <= Number of nodes <= 100
1 <= Data of a node <= 1000
We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?
Yes
