Handle
|
Score
|
|---|---|
| @Ibrahim Nash | 6420 |
| @blackshadows | 6380 |
| @mb1973 | 5642 |
| @Quandray | 5233 |
| @akhayrutdinov | 5111 |
| @saiujwal13083 | 4610 |
| @sanjay05 | 3762 |
| @kirtidee18 | 3673 |
| @marius_valentin_dragoi | 3522 |
| @sushant_a | 3459 |
| @verma_ji | 3413 |
| Complete Leaderboard | |
|
Handle
|
Score
|
| @sanskar94511 | 603 |
| @akashverma4 | 363 |
| @swastik8750 | 300 |
| @nishunishuraj18 | 286 |
| @surajmamgai | 264 |
| @anks9013 | 222 |
| @nayan2709 | 213 |
| @burhanuddinbohra72 | 212 |
| @realname | 203 |
| @amank8975 | 203 |
| @manmeetkaur18102000 | 202 |
| Complete Leaderboard | |
Given a Binary Tree, convert it into its mirror.
Example 1:
Problem of the Day
Problem of the Day
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 <= 105
1 <= Data of a node <= 105
We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?
Yes
