JZ18 - 두 갈래 나무의 거울

제목 설명

설명 입력:

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

문제 풀이 사고방식

# -*- coding:utf-8 -*-
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None
class Solution:
    #  
    def Mirror(self, root):
        # write code here
        if root == None:
            return
        root.left, root.right = root.right, root.left
        self.Mirror(root.left)
        self.Mirror(root.right)
        return root

/* function TreeNode(x) {
    this.val = x;
    this.left = null;
    this.right = null;
} */
function Mirror(root)
{
    if(root == null){
        return;
    }
    var temp = root.left;
    root.left = root.right;
    root.right = temp;
    Mirror(root.left);
    Mirror(root.right);
}

# -*- coding:utf-8 -*-
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None
class Solution:
    def Mirror(self, root):
        # write code here
        q = [root]
        while q:
            curNode = q.pop(0)
            if not curNode:
                return None
            if curNode.left:
                q.append(curNode.left)
            if curNode.right:
                q.append(curNode.right)
            curNode.left, curNode.right = curNode.right, curNode.left