Skip to content

Commit 09a9dcc

Browse files
stevencooksstevencooks
committed
101 (3) update tests
1 parent 3cc9d5d commit 09a9dcc

File tree

3 files changed

+49
-88
lines changed

3 files changed

+49
-88
lines changed

‎src/_101_SymmetricTree/Solution.java

Lines changed: 3 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -44,14 +44,13 @@ public boolean isSymmetric(TreeNode root) {
4444
private boolean isMirror(TreeNode left, TreeNode right) {
4545
if (left == null && right == null) {
4646
return true;
47-
48-
}
49-
if (left != null && right != null) {
47+
} else if (left != null && right != null) {
5048
return left.val == right.val
5149
&& isMirror(left.left, right.right)
5250
&& isMirror(left.right, right.left) ;
51+
} else {
52+
return false;
5353
}
54-
return false;
5554
}
5655

5756
}

‎test/_101_SymmetricTree/PracticeTest.java

Lines changed: 23 additions & 42 deletions
Original file line numberDiff line numberDiff line change
@@ -32,43 +32,25 @@ public void tearDown() throws Exception {
3232
@Test
3333
public void Test1() {
3434
TreeNode t1 = new TreeNode(1);
35-
TreeNode root = t1;
36-
boolean actual = solution.isSymmetric(root);
37-
assertEquals(true, actual);
35+
assertTrue(solution.isSymmetric(t1));
3836
}
3937

40-
// 1
41-
// / \
42-
// 2 2
43-
// \ /
44-
// 4 4
38+
// 1
39+
// / \
40+
// 2 2
41+
// \ /
42+
// 4 4
4543
@Test
4644
public void Test3() {
47-
TreeNode t1 = new TreeNode(1);
48-
TreeNode t2 = new TreeNode(2);
49-
TreeNode t3 = new TreeNode(2);
50-
TreeNode t4 = new TreeNode(4);
51-
TreeNode t5 = new TreeNode(4);
52-
TreeNode.connect(t1, t2, t3);
53-
TreeNode.connect(t2, null, t4);
54-
TreeNode.connect(t3, t5, null);
55-
TreeNode root = t1;
56-
boolean actual = solution.isSymmetric(root);
57-
assertEquals(true, actual);
45+
assertTrue(solution.isSymmetric(TreeNode.getTree14()));
5846
}
5947

60-
// 1
61-
// / \
62-
// 2 3
48+
// 1
49+
// / \
50+
// 2 3
6351
@Test
6452
public void Test4() {
65-
TreeNode t1 = new TreeNode(1);
66-
TreeNode t2 = new TreeNode(2);
67-
TreeNode t3 = new TreeNode(3);
68-
TreeNode.connect(t1, t2, t3);
69-
TreeNode root = t1;
70-
boolean actual = solution.isSymmetric(root);
71-
assertEquals(false, actual);
53+
assertTrue(!solution.isSymmetric(TreeNode.getTree3()));
7254
}
7355

7456
// 1
@@ -80,8 +62,7 @@ public void Test5() {
8062
TreeNode t2 = new TreeNode(3);
8163
TreeNode.connect(t1, null, t2);
8264
TreeNode root = t1;
83-
boolean actual = solution.isSymmetric(root);
84-
assertEquals(false, actual);
65+
assertFalse(solution.isSymmetric(root));
8566
}
8667

8768
// 1
@@ -91,17 +72,17 @@ public void Test5() {
9172
// 4 4
9273
@Test
9374
public void Test6() {
94-
TreeNode t1 = new TreeNode(1);
95-
TreeNode t2 = new TreeNode(3);
96-
TreeNode t3 = new TreeNode(3);
97-
TreeNode t4 = new TreeNode(4);
98-
TreeNode t5 = new TreeNode(4);
99-
TreeNode.connect(t1, t2, t3);
100-
TreeNode.connect(t2, t4, null);
101-
TreeNode.connect(t3, t5, null);
102-
TreeNode root = t1;
103-
boolean actual = solution.isSymmetric(root);
104-
assertEquals(false, actual);
75+
assertFalse(solution.isSymmetric(TreeNode.getTree15()));
76+
}
77+
78+
// 1
79+
// / \
80+
// 2 2
81+
// / \ / \
82+
// 8 4 4 8
83+
@Test
84+
public void Test7() {
85+
assertTrue(solution.isSymmetric(TreeNode.getTree16()));
10586
}
10687

10788
}

‎test/_101_SymmetricTree/SolutionTest.java

Lines changed: 23 additions & 42 deletions
Original file line numberDiff line numberDiff line change
@@ -32,43 +32,25 @@ public void tearDown() throws Exception {
3232
@Test
3333
public void Test1() {
3434
TreeNode t1 = new TreeNode(1);
35-
TreeNode root = t1;
36-
boolean actual = solution.isSymmetric(root);
37-
assertEquals(true, actual);
35+
assertTrue(solution.isSymmetric(t1));
3836
}
3937

40-
// 1
41-
// / \
42-
// 2 2
43-
// \ /
44-
// 4 4
38+
// 1
39+
// / \
40+
// 2 2
41+
// \ /
42+
// 4 4
4543
@Test
4644
public void Test3() {
47-
TreeNode t1 = new TreeNode(1);
48-
TreeNode t2 = new TreeNode(2);
49-
TreeNode t3 = new TreeNode(2);
50-
TreeNode t4 = new TreeNode(4);
51-
TreeNode t5 = new TreeNode(4);
52-
TreeNode.connect(t1, t2, t3);
53-
TreeNode.connect(t2, null, t4);
54-
TreeNode.connect(t3, t5, null);
55-
TreeNode root = t1;
56-
boolean actual = solution.isSymmetric(root);
57-
assertEquals(true, actual);
45+
assertTrue(solution.isSymmetric(TreeNode.getTree14()));
5846
}
5947

60-
// 1
61-
// / \
62-
// 2 3
48+
// 1
49+
// / \
50+
// 2 3
6351
@Test
6452
public void Test4() {
65-
TreeNode t1 = new TreeNode(1);
66-
TreeNode t2 = new TreeNode(2);
67-
TreeNode t3 = new TreeNode(3);
68-
TreeNode.connect(t1, t2, t3);
69-
TreeNode root = t1;
70-
boolean actual = solution.isSymmetric(root);
71-
assertEquals(false, actual);
53+
assertTrue(!solution.isSymmetric(TreeNode.getTree3()));
7254
}
7355

7456
// 1
@@ -80,8 +62,7 @@ public void Test5() {
8062
TreeNode t2 = new TreeNode(3);
8163
TreeNode.connect(t1, null, t2);
8264
TreeNode root = t1;
83-
boolean actual = solution.isSymmetric(root);
84-
assertEquals(false, actual);
65+
assertFalse(solution.isSymmetric(root));
8566
}
8667

8768
// 1
@@ -91,17 +72,17 @@ public void Test5() {
9172
// 4 4
9273
@Test
9374
public void Test6() {
94-
TreeNode t1 = new TreeNode(1);
95-
TreeNode t2 = new TreeNode(3);
96-
TreeNode t3 = new TreeNode(3);
97-
TreeNode t4 = new TreeNode(4);
98-
TreeNode t5 = new TreeNode(4);
99-
TreeNode.connect(t1, t2, t3);
100-
TreeNode.connect(t2, t4, null);
101-
TreeNode.connect(t3, t5, null);
102-
TreeNode root = t1;
103-
boolean actual = solution.isSymmetric(root);
104-
assertEquals(false, actual);
75+
assertFalse(solution.isSymmetric(TreeNode.getTree15()));
76+
}
77+
78+
// 1
79+
// / \
80+
// 2 2
81+
// / \ / \
82+
// 8 4 4 8
83+
@Test
84+
public void Test7() {
85+
assertTrue(solution.isSymmetric(TreeNode.getTree16()));
10586
}
10687

10788
}

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