二叉树的镜像

题目描述

操作给定的二叉树，将其变换为源二叉树的镜像。

输入描述:

二叉树的镜像定义：源二叉树 
    	    8
    	   /  \
    	  6   10
    	 / \  / \
    	5  7 9 11
    	镜像二叉树
    	    8
    	   /  \
    	  10   6
    	 / \  / \
    	11 9 7  5

Solution
/**
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 temp = root.left;
        root.left = root.right;
        root.right = temp;
        
        //求左右子树的镜像
        if(root.left != null){
            Mirror(root.left);
        }
        if(root.right != null){
            Mirror(root.right);
        }
    }
}
*/
import java.util.Stack;
public class Solution {
    public void Mirror(TreeNode root) {
    	Stack<TreeNode> stack = new Stack<TreeNode>();
        if(root == null)
            return;
        stack.push(root);
        while(!stack.empty()){
        	root = stack.pop();
        	TreeNode temp = root.left;
        	root.left = root.right;
        	root.right = temp;
            //求左右子树的镜像
            if(root.left != null){
            	stack.push(root.left);
            }
            if(root.right != null){
                stack.push(root.right);
        	}
        }
    }
}