剑指offer -二叉树的镜像

/*
struct TreeNode {
	int val;
	struct TreeNode *left;
	struct TreeNode *right;
	TreeNode(int x) :
			val(x), left(NULL), right(NULL) {
	}
};*/
class Solution {
public:
    void Mirror(TreeNode *pRoot) {
        if(pRoot==NULL||pRoot->left==NULL&&pRoot->right==NULL)
            return;
        TreeNode *temp=pRoot->left;
        pRoot->left=pRoot->right;
        pRoot->right=temp;
        Mirror(pRoot->left);
        Mirror(pRoot->right);

    }
};
class Solution {
public:
    void Mirror(TreeNode *pRoot) {
        if(pRoot==NULL)
            return;
        stack <TreeNode*>stackNode;
        stackNode.push(pRoot);
        while(stackNode.size()){
            TreeNode *Tree=stackNode.top();
            stackNode.pop();
            if (Tree->left!=NULL||Tree->right!=NULL){
                TreeNode *temp=Tree->left;
                Tree->left=Tree->right;
                Tree->right=temp;
        
            }
            if (Tree->left){
                stackNode.push(Tree->left);
            }
            if(Tree->right)
                stackNode.push(Tree->right);
        }
        

    }
};