Handle
|
Score
|
|---|---|
| @Ibrahim Nash | 6560 |
| @blackshadows | 6400 |
| @mb1973 | 5777 |
| @Quandray | 5275 |
| @akhayrutdinov | 5111 |
| @saiujwal13083 | 5074 |
| @kirtidee18 | 4408 |
| @sanjay05 | 3762 |
| @mantu_singh | 3666 |
| @gfgaccount | 3605 |
| @marius_valentin_dragoi | 3525 |
| Complete Leaderboard | |
|
Handle
|
Score
|
| @anish5256 | 991 |
| @vimleshpratapsingh321 | 980 |
| @skj7 | 953 |
| @kanewilliamson123 | 894 |
| @pradeeppatidar1999 | 868 |
| @akhileshkumar562002 | 862 |
| @wallflowe101 | 826 |
| @pd420786 | 813 |
| @infilooop | 800 |
| @bunnybug320 | 796 |
| @nikhilkushwah280 | 796 |
| 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
