克隆二叉树

"""
Definition of TreeNode:
class TreeNode:
    def __init__(self, val):
        self.val = val
        self.left, self.right = None, None
"""

class Solution:
    """
    @param root: The root of binary tree
    @return: root of new tree
    """
    def cloneTree(self, root):
        # write your code here
        if root is None:
            return
        
        rootc = root
        rootc.left = self.cloneTree(root.left)
        rootc.right = self.cloneTree(root.right)
        
        return rootc
        

递归思想：把根节点赋值，然后同样的方法作用于左节点和右节点！