검지 Offer: 두 갈래 나무의 거울(java 버전)

제목 설명

  
    	    8
    	   /  \     
    	  6   10
    	 / \  / \
    	5  7 9  11
 
    	    8
    	   /  \
    	  10   6
    	 / \  / \
    	11 9 7   5

귀속판

/**
public class TreeNode {
    int val = 0;
    TreeNode left = null;
    TreeNode right = null;
 
    public TreeNode(int val) {
        this.val = val;
 
    }
 
}
*/
import java.util.*;
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);
    }
}

비귀속판

public class Solution {
    public void Mirror(TreeNode root) {
        if(root==null)
            return ;
        Stack<TreeNode> stack = new Stack<>();
        stack.push(root);
        while(!stack.isEmpty()){
            TreeNode node = stack.pop();
            if(node.left!=null || node.right!=null){
                TreeNode temp = node.left;
                node.left = node.right;
                node.right = temp;
            }
            if(node.left!=null)
                stack.push(node.left);
            if(node.right!=null)
                stack.push(node.right);
        }
    }
}