From 507a1ddde21828d1c91064347f57681db2e88aa6 Mon Sep 17 00:00:00 2001 From: Valentyn Kolesnikov Date: Mon, 10 Feb 2025 10:14:28 +0200 Subject: [PATCH] Improved task 429 --- .../SolutionTest.java | 33 +++++++++++++++++++ 1 file changed, 33 insertions(+) diff --git a/src/test/java/g0401_0500/s0429_n_ary_tree_level_order_traversal/SolutionTest.java b/src/test/java/g0401_0500/s0429_n_ary_tree_level_order_traversal/SolutionTest.java index 407efd70a..6b2faca10 100644 --- a/src/test/java/g0401_0500/s0429_n_ary_tree_level_order_traversal/SolutionTest.java +++ b/src/test/java/g0401_0500/s0429_n_ary_tree_level_order_traversal/SolutionTest.java @@ -26,4 +26,37 @@ void levelOrder() { expected.add(Arrays.asList(5, 6)); assertThat(new Solution().levelOrder(root).toString(), equalTo(expected.toString())); } + + @Test + void levelOrder2() { + Node root = new Node(1); + Node node2 = new Node(2); + Node node3 = new Node(3); + Node node4 = new Node(4); + Node node5 = new Node(5); + root.neighbors = Arrays.asList(node2, node3, node4, node5); + Node node6 = new Node(6); + Node node7 = new Node(7); + node3.neighbors = Arrays.asList(node6, node7); + Node node11 = new Node(11); + node7.neighbors = Arrays.asList(node11); + Node node14 = new Node(14); + node11.neighbors = Arrays.asList(node14); + Node node8 = new Node(8); + node4.neighbors = Arrays.asList(node8); + Node node12 = new Node(12); + node8.neighbors = Arrays.asList(node12); + Node node9 = new Node(9); + Node node10 = new Node(10); + node5.neighbors = Arrays.asList(node9, node10); + Node node13 = new Node(13); + node9.neighbors = Arrays.asList(node13); + List> expected = new ArrayList<>(); + expected.add(Arrays.asList(1)); + expected.add(Arrays.asList(2, 3, 4, 5)); + expected.add(Arrays.asList(6, 7, 8, 9, 10)); + expected.add(Arrays.asList(11, 12, 13)); + expected.add(Arrays.asList(14)); + assertThat(new Solution().levelOrder(root).toString(), equalTo(expected.toString())); + } }