ProblemSolving/AddOneRowTotTree.py at master · ahmaddroobi99/ProblemSolving · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def addOneRow(self, root: Optional[TreeNode], v: int, d: int) -> TreeNode:
        def dfs(node, depth, d):
            if not root:
                return None
            elif d == 1:
                temp = TreeNode(v, left=node.left)
                return temp
            elif depth == d - 1:
                node.left = TreeNode(v, left=node.left)
                node.right = TreeNode(v, right=node.right)
                return node
            dfs(node.left, depth + 1, d)
            dfs(node.right, depth + 1, d)
            return node

        return dfs(root, 1, d)

________________________________________________________
class Solution:
    def addOneRow(self, root: TreeNode, v: int, d: int) -> TreeNode:
        if d == 1:
            n = TreeNode(v)
            n.left = root
            return n
        q = [root]
        for _ in range(d - 2):
            tmp = []
            for n in q:
                if n.left:
                    tmp.append(n.left)
                if n.right:
                    tmp.append(n.right)
            q = tmp
        for node in q:
            tmp = node.left;
            node.left = TreeNode(v);
            node.left.left = tmp;
            tmp = node.right;
            node.right = TreeNode(v);
            node.right.right = tmp;
        return root