diff options
| author | mo khan <mo.khan@gmail.com> | 2020-07-11 16:57:30 -0600 |
|---|---|---|
| committer | mo khan <mo.khan@gmail.com> | 2020-07-11 16:57:30 -0600 |
| commit | 01080bad55e3d7ae47c6b1df64c48496b32ba544 (patch) | |
| tree | a2ab738787b0fc88cd50bbda3d10d2199fd1236a /src | |
| parent | 75941ee7c57805f931a2fd1e40b2d109c7ac30de (diff) | |
Call destructor after each spec
Diffstat (limited to 'src')
| -rw-r--r-- | src/02/01/binary_tree_test.c | 10 |
1 files changed, 10 insertions, 0 deletions
diff --git a/src/02/01/binary_tree_test.c b/src/02/01/binary_tree_test.c index 68615e9..554f322 100644 --- a/src/02/01/binary_tree_test.c +++ b/src/02/01/binary_tree_test.c @@ -30,6 +30,7 @@ Ensure(BinaryTree, when_traversing_in_preorder_when_the_tree_has_a_single_node) assert_that(visited_count, is_equal_to(1)); assert_that(visited[0], is_equal_to(100)); + destroy(node); } Ensure(BinaryTree, when_traversing_in_preorder_when_the_tree_has_a_left_node) { @@ -41,6 +42,7 @@ Ensure(BinaryTree, when_traversing_in_preorder_when_the_tree_has_a_left_node) { assert_that(visited_count, is_equal_to(2)); assert_that(visited[0], is_equal_to(100)); assert_that(visited[1], is_equal_to(200)); + destroy(node); } Ensure(BinaryTree, when_traversing_in_preorder_when_the_tree_has_a_right_node) { @@ -52,6 +54,7 @@ Ensure(BinaryTree, when_traversing_in_preorder_when_the_tree_has_a_right_node) { assert_that(visited_count, is_equal_to(2)); assert_that(visited[0], is_equal_to(100)); assert_that(visited[1], is_equal_to(300)); + destroy(node); } Ensure(BinaryTree, when_traversing_in_preorder_when_the_tree_has_a_left_and_right_node) { @@ -65,6 +68,7 @@ Ensure(BinaryTree, when_traversing_in_preorder_when_the_tree_has_a_left_and_righ assert_that(visited[0], is_equal_to(100)); assert_that(visited[1], is_equal_to(200)); assert_that(visited[2], is_equal_to(300)); + destroy(node); } Ensure(BinaryTree, when_traversing_in_preorder_when_the_tree_has_multiple_levels) { @@ -83,6 +87,7 @@ Ensure(BinaryTree, when_traversing_in_preorder_when_the_tree_has_multiple_levels assert_that(visited[2], is_equal_to(400)); assert_that(visited[3], is_equal_to(500)); assert_that(visited[4], is_equal_to(300)); + destroy(node); } Ensure(BinaryTree, when_traversing_in_postorder_when_the_tree_is_empty) { @@ -98,6 +103,7 @@ Ensure(BinaryTree, when_traversing_in_postorder_when_the_tree_has_a_single_node) assert_that(visited_count, is_equal_to(1)); assert_that(visited[0], is_equal_to(100)); + destroy(node); } Ensure(BinaryTree, when_traversing_in_postorder_when_the_tree_has_a_left_node) { @@ -109,6 +115,7 @@ Ensure(BinaryTree, when_traversing_in_postorder_when_the_tree_has_a_left_node) { assert_that(visited_count, is_equal_to(2)); assert_that(visited[0], is_equal_to(200)); assert_that(visited[1], is_equal_to(100)); + destroy(node); } Ensure(BinaryTree, when_traversing_in_postorder_when_the_tree_has_a_right_node) { @@ -120,6 +127,7 @@ Ensure(BinaryTree, when_traversing_in_postorder_when_the_tree_has_a_right_node) assert_that(visited_count, is_equal_to(2)); assert_that(visited[0], is_equal_to(300)); assert_that(visited[1], is_equal_to(100)); + destroy(node); } Ensure(BinaryTree, when_traversing_in_postorder_when_the_tree_has_a_left_and_right_node) { @@ -133,6 +141,7 @@ Ensure(BinaryTree, when_traversing_in_postorder_when_the_tree_has_a_left_and_rig assert_that(visited[0], is_equal_to(200)); assert_that(visited[1], is_equal_to(300)); assert_that(visited[2], is_equal_to(100)); + destroy(node); } Ensure(BinaryTree, when_traversing_in_postorder_when_the_tree_has_multiple_levels) { @@ -151,6 +160,7 @@ Ensure(BinaryTree, when_traversing_in_postorder_when_the_tree_has_multiple_level assert_that(visited[2], is_equal_to(200)); assert_that(visited[3], is_equal_to(300)); assert_that(visited[4], is_equal_to(100)); + destroy(node); } TestSuite *binary_tree_tests() { |