Diameter of N-ary Tree

cpp

/**
 * Definition for an n-ary tree node.
 * class TreeNode {
 * public:
 *     int val;
 *     vector<TreeNode*> children;
 * 
 *     TreeNode() {}
 * 
 *     TreeNode(int _val) {
 *         val = _val;
 *     }
 * 
 *     TreeNode(int _val, vector<TreeNode*> _children) {
 *         val = _val;
 *         children = _children;
 *     }
 * };
 **/


class Solution {
public:
    int diameter(TreeNode* root) {
       
    }
};

java

/**
 * Definition for an n-ary tree node.
 * class TreeNode {
 *     int val;
 *     List<TreeNode> children;
 * 
 *     TreeNode(int _val) {
 *         val = _val;
 *         children = new ArrayList<>();
 *     }
 * }
 **/


class Solution {
    public int diameter(TreeNode root) {
        //Your Code Goes Here
    }
}

python

"""
# Definition for a Node.
class TreeNode(object):
    def __init__(self, val=None, children=None):
        self.val = val
        self.children = children if children is not None else []
"""

class Solution():
    def diameter(self, root):
        """
        :type root: 'Node'
        :rtype: int
        """
        #Your Code Goes Here

javascript

/**
 * Definition for an n-ary tree node.
 * class TreeNode {
 *      constructor(val) {
 *          this.val = val;
 *          this.children = [];
 *      }
 * }
 **/

class Solution {
    diameter(root) {
        
    }
}

csharp

/**
 * Definition for an n-ary tree node.
 * public class TreeNode {
 *     public int val;
 *     public List<TreeNode> children;
 *     public TreeNode() {}
 *     public TreeNode(int val) { this.val = val; }
 *     public TreeNode(int val, List<TreeNode> children) {
 *         this.val = val;
 *         this.children = children;
 *     }
 * }
 */

public class Solution
{
    public int diameter(TreeNode root)
    {
        //Your Code Goes Here
    }
}

go

func diameter(root *TreeNode) int {
	
}