LintCode:克隆二叉树

LintCode:克隆二叉树

"""Definition of TreeNode:class TreeNode:    def __init__(self, val):        this.val = val        this.left, this.right = None, None"""class Solution:    """    @param {TreeNode} root: The root of binary tree    @return {TreeNode} root of new tree    """    def cloneTree(self, root):        # Write your code here        if not root:            return root        my_root = TreeNode(root.val)        self.pre_order_clone(my_root, root)        return my_root    def pre_order_clone(self, my_root, root):        if not root:            return        if root.left:            my_root.left = TreeNode(root.left.val)            self.pre_order_clone(my_root.left, root.left)        if root.right:            my_root.right = TreeNode(root.right.val)            self.pre_order_clone(my_root.right, root.right)