LC: 1490. Clone N ary Tree

https://leetcode.com/problems/clone-n-ary-tree/

1490. Clone N-ary Tree

Given a root of an N-ary tree, return a deep copy (clone) of the tree.

Each node in the n-ary tree contains a val (int) and a list (List[Node]) of its children.

class Node {
    public int val;
    public List<Node> children;
}

Nary-Tree input serialization is represented in their level order traversal, each group of children is separated by the null value (See examples).

Example 1:

Input: root = [1,null,3,2,4,null,5,6]
Output: [1,null,3,2,4,null,5,6]

Example 2:

Input: root = [1,null,2,3,4,5,null,null,6,7,null,8,null,9,10,null,null,11,null,12,null,13,null,null,14]
Output: [1,null,2,3,4,5,null,null,6,7,null,8,null,9,10,null,null,11,null,12,null,13,null,null,14]

Constraints:

The depth of the n-ary tree is less than or equal to 1000.
The total number of nodes is between [0, 104].

Follow up: Can your solution work for the graph problem?

Details:

Zuerst ist der Wurzel geklont. Dann sind ihre Kinder mit derselben Methode geklont. Danach fügt man die geklonte Bäume aus den Kinderknoten als Kinder zu dem geklonten Wurzelknoten zu.

Solution(s):

algorithms/src/main/java/algorithms/curated170/medium/CloneNaryTree.java at master · spiralgo/algorithmsGitHub

Default Code:

/*
// Definition for a Node.
class Node {
    public int val;
    public List<Node> children;

    
    public Node() {
        children = new ArrayList<Node>();
    }
    
    public Node(int _val) {
        val = _val;
        children = new ArrayList<Node>();
    }
    
    public Node(int _val,ArrayList<Node> _children) {
        val = _val;
        children = _children;
    }
};
*/

class Solution {
    public Node cloneTree(Node root) {
        
    }
}

PreviousLC: 1474. Delete N Nodes After M Nodes of a Linked List NextLC: 1506. Find Root of N Ary Tree

Last updated 3 years ago