1.问题描述:
深度复制一个二叉树。给定一个二叉树,返回一个他的 克隆品 。
2.样例:
给定一个二叉树:
1
/ \
2 3
/ \
4 5
返回其相同结构相同数值的克隆二叉树:
1
/ \
2 3
/ \
4 5
3.代码:""" Definition of TreeNode: class TreeNode: def __init__(self, val): this.val = val this.left, this.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 None newroot=root newroot.val=root.val self.cloneTree(newroot.left) self.cloneTree(newroot.right) return newroot