/*
// Definition for a Node.
class Node {
public int val;
public List<Node> children;
public Node(){}
public Node(int _val){
val = _val;}
public Node(int _val, List<Node> _children){
val = _val;
children = _children;}};
*/
class Solution {
private int max=0;
public int maxDepth(Node root){
if(root==null){return max;}
helper(root,1);return max;}
public void helper(Node root,int level){
if(root==null){return;}
for(Node node:root.children){
helper(node,level+1);}
max=Math.max(max,level);}}
559. Maximum Depth of N-ary Tree/*// Definition for a Node.class Node { public int val; public List<Node> children; public Node() {} public Node(int _val) { val = _val; } public Node(int _val, List<Node> _c