MCPcopy Create free account
hub / github.com/ROUTINE-STUDY/Algorithm / Node

Class Node

LeetCode/DFS/589. N-ary Tree Preorder Traversal/IngyuDFS.java:5–19  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

3import java.util.Stack;
4
5class Node {
6 public int val;
7 public List<Node> children;
8
9 public Node() {}
10
11 public Node(int _val) {
12 val = _val;
13 }
14
15 public Node(int _val, List<Node> _children) {
16 val = _val;
17 children = _children;
18 }
19};
20
21class Solution {
22 public List<Integer> preorder(Node root) {

Callers

nothing calls this directly

Calls

no outgoing calls

Tested by

no test coverage detected