Skip to content

Commit d076889

Browse files
stevencooksstevencooks
committed
102 (3) update tests
1 parent 09a9dcc commit d076889

File tree

2 files changed

+96
-42
lines changed

2 files changed

+96
-42
lines changed

‎test/_102_BinaryTreeLevelOrderTraversal/PracticeTest.java

Lines changed: 48 additions & 21 deletions
Original file line numberDiff line numberDiff line change
@@ -110,32 +110,26 @@ public void Test4() {
110110
// 1
111111
@Test
112112
public void Test5() {
113-
TreeNode t1 = new TreeNode(1);
114-
TreeNode root = t1;
113+
TreeNode root = TreeNode.getTree0();
115114
List<List<Integer>> actual = solution.levelOrder(root);
116115
List<List<Integer>> expected = new ArrayList<>();
117116
expected.add(Arrays.asList(1));
118117
assertEquals(expected, actual);
119118
}
120119

121-
// 3
122-
// \
123-
// 20
124-
// \
125-
// 15
120+
// 1
121+
// \
122+
// 2
123+
// \
124+
// 3
126125
@Test
127126
public void Test6() {
128-
TreeNode t1 = new TreeNode(3);
129-
TreeNode t3 = new TreeNode(20);
130-
TreeNode t4 = new TreeNode(15);
131-
TreeNode.connect(t1, null, t3);
132-
TreeNode.connect(t3, null, t4);
133-
TreeNode root = t1;
127+
TreeNode root = TreeNode.getTree1();
134128
List<List<Integer>> actual = solution.levelOrder(root);
135129
List<List<Integer>> expected = new ArrayList<>();
130+
expected.add(Arrays.asList(1));
131+
expected.add(Arrays.asList(2));
136132
expected.add(Arrays.asList(3));
137-
expected.add(Arrays.asList(20));
138-
expected.add(Arrays.asList(15));
139133
assertEquals(expected, actual);
140134
}
141135

@@ -146,12 +140,7 @@ public void Test6() {
146140
// 3
147141
@Test
148142
public void Test7() {
149-
TreeNode t1 = new TreeNode(1);
150-
TreeNode t3 = new TreeNode(2);
151-
TreeNode t4 = new TreeNode(3);
152-
TreeNode.connect(t1, t3, null);
153-
TreeNode.connect(t3, t4, null);
154-
TreeNode root = t1;
143+
TreeNode root = TreeNode.getTree2();
155144
List<List<Integer>> actual = solution.levelOrder(root);
156145
List<List<Integer>> expected = new ArrayList<>();
157146
expected.add(Arrays.asList(1));
@@ -160,4 +149,42 @@ public void Test7() {
160149
assertEquals(expected, actual);
161150
}
162151

152+
// 5
153+
// / \
154+
// 4 8
155+
// / / \
156+
// 11 13 4
157+
// / \ / \
158+
// 7 2 5 1
159+
@Test
160+
public void Test8() {
161+
TreeNode root = TreeNode.getTree4();
162+
List<List<Integer>> actual = solution.levelOrder(root);
163+
List<List<Integer>> expected = new ArrayList<>();
164+
expected.add(Arrays.asList(5));
165+
expected.add(Arrays.asList(4, 8));
166+
expected.add(Arrays.asList(11, 13, 4));
167+
expected.add(Arrays.asList(7, 2, 5, 1));
168+
assertEquals(expected, actual);
169+
}
170+
171+
// 8
172+
// \
173+
// 6
174+
// / \
175+
// 3 7
176+
// / \ \
177+
// 2 4 10
178+
@Test
179+
public void Test9() {
180+
TreeNode root = TreeNode.getTree13();
181+
List<List<Integer>> actual = solution.levelOrder(root);
182+
List<List<Integer>> expected = new ArrayList<>();
183+
expected.add(Arrays.asList(8));
184+
expected.add(Arrays.asList(6));
185+
expected.add(Arrays.asList(3, 7));
186+
expected.add(Arrays.asList(2, 4, 10));
187+
assertEquals(expected, actual);
188+
}
189+
163190
}

‎test/_102_BinaryTreeLevelOrderTraversal/SolutionTest.java

Lines changed: 48 additions & 21 deletions
Original file line numberDiff line numberDiff line change
@@ -110,32 +110,26 @@ public void Test4() {
110110
// 1
111111
@Test
112112
public void Test5() {
113-
TreeNode t1 = new TreeNode(1);
114-
TreeNode root = t1;
113+
TreeNode root = TreeNode.getTree0();
115114
List<List<Integer>> actual = solution.levelOrder(root);
116115
List<List<Integer>> expected = new ArrayList<>();
117116
expected.add(Arrays.asList(1));
118117
assertEquals(expected, actual);
119118
}
120119

121-
// 3
122-
// \
123-
// 20
124-
// \
125-
// 15
120+
// 1
121+
// \
122+
// 2
123+
// \
124+
// 3
126125
@Test
127126
public void Test6() {
128-
TreeNode t1 = new TreeNode(3);
129-
TreeNode t3 = new TreeNode(20);
130-
TreeNode t4 = new TreeNode(15);
131-
TreeNode.connect(t1, null, t3);
132-
TreeNode.connect(t3, null, t4);
133-
TreeNode root = t1;
127+
TreeNode root = TreeNode.getTree1();
134128
List<List<Integer>> actual = solution.levelOrder(root);
135129
List<List<Integer>> expected = new ArrayList<>();
130+
expected.add(Arrays.asList(1));
131+
expected.add(Arrays.asList(2));
136132
expected.add(Arrays.asList(3));
137-
expected.add(Arrays.asList(20));
138-
expected.add(Arrays.asList(15));
139133
assertEquals(expected, actual);
140134
}
141135

@@ -146,12 +140,7 @@ public void Test6() {
146140
// 3
147141
@Test
148142
public void Test7() {
149-
TreeNode t1 = new TreeNode(1);
150-
TreeNode t3 = new TreeNode(2);
151-
TreeNode t4 = new TreeNode(3);
152-
TreeNode.connect(t1, t3, null);
153-
TreeNode.connect(t3, t4, null);
154-
TreeNode root = t1;
143+
TreeNode root = TreeNode.getTree2();
155144
List<List<Integer>> actual = solution.levelOrder(root);
156145
List<List<Integer>> expected = new ArrayList<>();
157146
expected.add(Arrays.asList(1));
@@ -160,4 +149,42 @@ public void Test7() {
160149
assertEquals(expected, actual);
161150
}
162151

152+
// 5
153+
// / \
154+
// 4 8
155+
// / / \
156+
// 11 13 4
157+
// / \ / \
158+
// 7 2 5 1
159+
@Test
160+
public void Test8() {
161+
TreeNode root = TreeNode.getTree4();
162+
List<List<Integer>> actual = solution.levelOrder(root);
163+
List<List<Integer>> expected = new ArrayList<>();
164+
expected.add(Arrays.asList(5));
165+
expected.add(Arrays.asList(4, 8));
166+
expected.add(Arrays.asList(11, 13, 4));
167+
expected.add(Arrays.asList(7, 2, 5, 1));
168+
assertEquals(expected, actual);
169+
}
170+
171+
// 8
172+
// \
173+
// 6
174+
// / \
175+
// 3 7
176+
// / \ \
177+
// 2 4 10
178+
@Test
179+
public void Test9() {
180+
TreeNode root = TreeNode.getTree13();
181+
List<List<Integer>> actual = solution.levelOrder(root);
182+
List<List<Integer>> expected = new ArrayList<>();
183+
expected.add(Arrays.asList(8));
184+
expected.add(Arrays.asList(6));
185+
expected.add(Arrays.asList(3, 7));
186+
expected.add(Arrays.asList(2, 4, 10));
187+
assertEquals(expected, actual);
188+
}
189+
163190
}

0 commit comments

Comments
 (0)
pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy