"""
# Definition for a Node.
class Node:
def __init__(self, val=None, children=None):
self.val = val
self.children = children if children is not None else []
"""
class Solution:
def cloneTree(self, root: 'Node') -> 'Node':
if not root:
return
clone=Node(root.val,[])
def dfs(node,cnode):
if not node:
return
print(node.val)
for c in node.children:
cchild=Node(c.val,[])
cnode.children.append(cchild)
dfs(c,cchild)
dfs(root,clone)
return clone
'알고리즘 문제 > Leetcode' 카테고리의 다른 글
797. All Paths From Source to Target (0) | 2023.04.17 |
---|---|
339. Nested List Weight Sum (0) | 2023.04.11 |
2391. Minimum Amount of Time to Collect Garbage (0) | 2023.04.11 |
2265. Count Nodes Equal to Average of Subtree (0) | 2023.04.11 |
1769. Minimum Number of Operations to Move All Balls to Each Box (0) | 2023.04.11 |