solves max depth of n ary tree

Author: anishLearnsToCode

README.md

@@ -146,7 +146,7 @@
 | 543 | [Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree) | Easy | [![Java](assets/java.png)](src/DiameterOfBinaryTree.java) [![Python](assets/python.png)](python/diameter_of_binary_tree.py) |
 | 551 | [Student Attendance Record I](https://leetcode.com/problems/student-attendance-record-i) | Easy | [![Java](assets/java.png)](src/StudentAttendanceRecordI.java) [![Python](assets/python.png)](python/student_attendance_record_I.py) |
 | 557 | [Reverse Words in a String III](https://leetcode.com/problems/reverse-words-in-a-string-iii) | Easy | [![Java](assets/java.png)](src/ReverseWordsInStringIII.java) [![Python](assets/python.png)](python/reverse_words_in_string_iii.py) |
-| 559 | [Maximum Depth of N-Ary Tree](https://leetcode.com/problems/maximum-depth-of-n-ary-tree) | Easy | |
+| 559 | [Maximum Depth of N-Ary Tree](https://leetcode.com/problems/maximum-depth-of-n-ary-tree) | Easy | [![Java](assets/java.png)](src/MaximumDepthOfNAryTree.java) [![Python](assets/python.png)](python/maximum_depth_of_n_ary_tree.py) |
 | 561 | [Array Partition I](https://leetcode.com/problems/array-partition-i) | Easy | |
 | 563 | [Binary Tree Tilt](https://leetcode.com/problems/binary-tree-tilt) | Easy | |
 | 566 | [Reshape The Matrix](https://leetcode.com/problems/reshape-the-matrix) | Easy | |

python/maximum_depth_of_n_ary_tree.py

@@ -0,0 +1,14 @@
+# Definition for a Node.
+class Node:
+    def __init__(self, val=None, children=None):
+        self.val = val
+        self.children = children
+
+
+class Solution:
+    def maxDepth(self, root: Node) -> int:
+        if root is None: return 0
+        max_depth = 0
+        for child in root.children:
+            max_depth = max(max_depth, self.maxDepth(child))
+        return 1 + max_depth

src/MaximumDepthOfNAryTree.java

@@ -0,0 +1,28 @@
+import java.util.List;
+
+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;
+    }
+};
+
+public class MaximumDepthOfNAryTree {
+    public int maxDepth(Node root) {
+        if (root == null) return 0;
+        int maxDepth = 0;
+        for (Node child : root.children) {
+            maxDepth = Math.max(maxDepth, maxDepth(child));
+        }
+        return 1 + maxDepth;
+    }
+}