[leetcode]623. Add One Row to Tree(Python)

题目描述

Category：Medium Tree

Given the root of a binary tree, then value v and depth d, you need to add a row of nodes with value v at the given depth d. The root node is at depth 1.
The adding rule is: given a positive integer depth d, for each NOT null tree nodes N in depth d-1, create two tree nodes with value v as N’s left subtree root and right subtree root. And N’s original left subtree should be the left subtree of the new left subtree root, its original right subtree should be the right subtree of the new right subtree root. If depth d is 1 that means there is no depth d-1 at all, then create a tree node with value v as the new root of the whole original tree, and the original tree is the new root’s left subtree.

题目理解

给定一棵二叉树和两个变量v（值）、d（深度），然后在d层添加值为v的节点。
注：root的深度为1，如果深度d是1，那么创建一个树节点，将值v作为整个原始树的新根，原始树是新根的左子树。

解题思路

递归

按照题目意思，如果d是1的话，新建节点，原来的root设成该节点的左边节点。如果d是2的话，就给root节点新建出左右节点，把原来的root子节点设置成新子节点的子节点即可
思路借鉴：https://blog.csdn.net/fuxuemingzhu/article/details/79645198

class Solution:
	# Runtime: 56ms 63.51%  MemoryUsage: 15.6MB 50.00%
    def addOneRow(self, root: TreeNode, v: int, d: int) -> TreeNode:
        if not root:
            return root
        if d == 1:
            left = TreeNode(v)
            left.left = root
            root = left
        elif d == 2:
            left = TreeNode(v)
            right = TreeNode(v)
            left.left = root.left
            right.right = root.right
            root.left = left
            root.right = right
        else:
            self.addOneRow(root.left, v, d - 1)
            self.addOneRow(root.right, v, d - 1)
        return root

MyMethod

循环 但是有点问题 羞于放上来 啥时候写好了再贴

Time

2020.3.23 心态爆炸的一天