Description of the problem: given binary operation, converts it into a binary source image.
/ * Previous preorder traversal of this tree for each node, if the node traversed node has children, exchanged its two child nodes,
After completion of the left and right child nodes to exchange all non-leaf nodes of the tree to get a mirror image * /
/**
public class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
public TreeNode(int val) {
this.val = val;
}
}
*/
public class Solution {
public void Mirror(TreeNode root) {
if(root == null)
return;
if(root.left == null && root.right == null)
return;
TreeNode pTemp = root.left;
root.left = root.right;
root.right = pTemp;
if(root.left != null)
Mirror(root.left);
if(root.right != null)
Mirror(root.right);
}
}
Running time: 24ms
Take up memory: 9676k