# 1522. Diameter of N-Ary Tree ## Description Given a `root` of an [N-ary tree](https://leetcode.com/articles/introduction-to-n-ary-trees/), you need to compute the length of the diameter of the tree. The diameter of an N-ary tree is the length of the **longest** path between any two nodes in the tree. This path may or may not pass through the root. (*Nary-Tree input serialization is represented in their level order traversal, each group of children is separated by the null value.)* **Example 1:** ![](https://assets.leetcode.com/uploads/2020/07/19/sample_2_1897.png) ``` **Input:** root = [1,null,3,2,4,null,5,6] **Output:** 3 **Explanation:** Diameter is shown in red color. ``` **Example 2:** ![](https://assets.leetcode.com/uploads/2020/07/19/sample_1_1897.png) ``` **Input:** root = [1,null,2,null,3,4,null,5,null,6] **Output:** 4 ``` **Example 3:** ![](https://assets.leetcode.com/uploads/2020/07/19/sample_3_1897.png) ``` **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:** 7 ``` **Constraints:** * The depth of the n-ary tree is less than or equal to `1000`. * The total number of nodes is between `[1, 104]`. ## ac ```java ``` --- # Agent Instructions: Querying This Documentation If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question. Perform an HTTP GET request on the current page URL with the `ask` query parameter: ``` GET https://jaywin.gitbook.io/leetcode/solutions/1522-diameter-of-n-ary-tree.md?ask= ``` The question should be specific, self-contained, and written in natural language. The response will contain a direct answer to the question and relevant excerpts and sources from the documentation. Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.