Given a Binary Tree, convert it into its mirror.
Example 1:
Input:
1
/ \
2 3
Output: 3 1 2
Explanation: The tree is
1 (mirror) 1
/ \ => / \
2 3 3 2
The inorder of mirror is 3 1 2
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.
My Answer:
void mirror(Node node) { // Your code here if (node == null) return; mirror(node.left); mirror(node.right); Node temp = node.left; node.left = node.right; node.right = temp; }
No comments:
Post a Comment