| 6 | import java.util.Queue; |
| 7 | |
| 8 | class Node { |
| 9 | public int val; |
| 10 | public List<Node> children; |
| 11 | |
| 12 | public Node() {} |
| 13 | public Node(int _val) { |
| 14 | val = _val; |
| 15 | } |
| 16 | public Node(int _val, List<Node> _children) { |
| 17 | val = _val; |
| 18 | children = _children; |
| 19 | } |
| 20 | } |
| 21 | /** |
| 22 | * https://leetcode.com/problems/maximum-depth-of-n-ary-tree/ |
| 23 | */ |
nothing calls this directly
no outgoing calls
no test coverage detected