From ecb58f08a69e0249be275ea7a27c8ff07c3452cb Mon Sep 17 00:00:00 2001
From: Manipal Reddy <manisreekar.sr@gmail.com>
Date: Fri, 11 Oct 2019 12:24:32 +0530
Subject: [PATCH] Added Solution for n-ary-tree-level-order-traversal (DFS)

---
 #429/solution.java | 18 ++++++++++++++++++
 1 file changed, 18 insertions(+)
 create mode 100644 #429/solution.java

diff --git a/#429/solution.java b/#429/solution.java
new file mode 100644
index 0000000..db3afa4
--- /dev/null
+++ b/#429/solution.java
@@ -0,0 +1,18 @@
+class Solution {
+    public List<List<Integer>> levelOrder(Node root) {
+        List<List<Integer>> result = new ArrayList<>();
+        DFS(root, 1, result);
+        return result;
+    }
+    
+    private void DFS(Node root, int level, List<List<Integer>> result) {
+        if(root == null) return;
+        if(result.size() < level) {
+            result.add(new ArrayList<>());
+        }
+        result.get(level - 1).add(root.val);
+        for(Node child : root.children) {
+            DFS(child, level + 1, result);
+        }
+    }
+}