From f9f81dd70c6ef52799df70de573cc94239432652 Mon Sep 17 00:00:00 2001 From: mo khan Date: Wed, 5 Aug 2020 20:29:12 -0600 Subject: Run clang fmt --- src/02/01/binary_tree_test.c | 94 ++++++++++++++++++++++++++++---------------- 1 file changed, 61 insertions(+), 33 deletions(-) diff --git a/src/02/01/binary_tree_test.c b/src/02/01/binary_tree_test.c index cf19b97..6293239 100644 --- a/src/02/01/binary_tree_test.c +++ b/src/02/01/binary_tree_test.c @@ -29,17 +29,11 @@ Node *next(Node *self, Node *x, enum Traversal traversal) { return NULL; } -Node *preorder_next(Node *self, Node *x) { - return next(self, x, PREORDER); -} +Node *preorder_next(Node *self, Node *x) { return next(self, x, PREORDER); } -Node *inorder_next(Node *self, Node *x) { - return next(self, x, INORDER); -} +Node *inorder_next(Node *self, Node *x) { return next(self, x, INORDER); } -Node *postorder_next(Node *self, Node *x) { - return next(self, x, POSTORDER); -} +Node *postorder_next(Node *self, Node *x) { return next(self, x, POSTORDER); } Ensure(BinaryTree, when_traversing_in_preorder_when_the_tree_is_empty) { traverse(NULL, visitor, PREORDER); @@ -334,30 +328,64 @@ Ensure(BinaryTree, when_finding_the_next_node_in_a_postorder_traversal) { TestSuite *binary_tree_tests() { TestSuite *suite = create_test_suite(); - add_test_with_context(suite, BinaryTree, when_traversing_in_preorder_when_the_tree_is_empty); - add_test_with_context(suite, BinaryTree, when_traversing_in_preorder_when_the_tree_has_a_single_node); - add_test_with_context(suite, BinaryTree, when_traversing_in_preorder_when_the_tree_has_a_left_node); - add_test_with_context(suite, BinaryTree, when_traversing_in_preorder_when_the_tree_has_a_right_node); - add_test_with_context(suite, BinaryTree, when_traversing_in_preorder_when_the_tree_has_a_left_and_right_node); - add_test_with_context(suite, BinaryTree, when_traversing_in_preorder_when_the_tree_has_multiple_levels); - - add_test_with_context(suite, BinaryTree, when_traversing_in_postorder_when_the_tree_is_empty); - add_test_with_context(suite, BinaryTree, when_traversing_in_postorder_when_the_tree_has_a_single_node); - add_test_with_context(suite, BinaryTree, when_traversing_in_postorder_when_the_tree_has_a_left_node); - add_test_with_context(suite, BinaryTree, when_traversing_in_postorder_when_the_tree_has_a_right_node); - add_test_with_context(suite, BinaryTree, when_traversing_in_postorder_when_the_tree_has_a_left_and_right_node); - add_test_with_context(suite, BinaryTree, when_traversing_in_postorder_when_the_tree_has_multiple_levels); - - add_test_with_context(suite, BinaryTree, when_traversing_inorder_when_the_tree_is_empty); - add_test_with_context(suite, BinaryTree, when_traversing_inorder_when_the_tree_has_a_single_node); - add_test_with_context(suite, BinaryTree, when_traversing_inorder_when_the_tree_has_a_left_node); - add_test_with_context(suite, BinaryTree, when_traversing_inorder_when_the_tree_has_a_right_node); - add_test_with_context(suite, BinaryTree, when_traversing_inorder_when_the_tree_has_a_left_and_right_node); - add_test_with_context(suite, BinaryTree, when_traversing_inorder_when_the_tree_has_multiple_levels); - - add_test_with_context(suite, BinaryTree, when_finding_the_next_node_in_a_preorder_traversal); - add_test_with_context(suite, BinaryTree, when_finding_the_next_node_in_a_inorder_traversal); - add_test_with_context(suite, BinaryTree, when_finding_the_next_node_in_a_postorder_traversal); + add_test_with_context(suite, BinaryTree, + when_traversing_in_preorder_when_the_tree_is_empty); + add_test_with_context( + suite, BinaryTree, + when_traversing_in_preorder_when_the_tree_has_a_single_node); + add_test_with_context( + suite, BinaryTree, + when_traversing_in_preorder_when_the_tree_has_a_left_node); + add_test_with_context( + suite, BinaryTree, + when_traversing_in_preorder_when_the_tree_has_a_right_node); + add_test_with_context( + suite, BinaryTree, + when_traversing_in_preorder_when_the_tree_has_a_left_and_right_node); + add_test_with_context( + suite, BinaryTree, + when_traversing_in_preorder_when_the_tree_has_multiple_levels); + + add_test_with_context(suite, BinaryTree, + when_traversing_in_postorder_when_the_tree_is_empty); + add_test_with_context( + suite, BinaryTree, + when_traversing_in_postorder_when_the_tree_has_a_single_node); + add_test_with_context( + suite, BinaryTree, + when_traversing_in_postorder_when_the_tree_has_a_left_node); + add_test_with_context( + suite, BinaryTree, + when_traversing_in_postorder_when_the_tree_has_a_right_node); + add_test_with_context( + suite, BinaryTree, + when_traversing_in_postorder_when_the_tree_has_a_left_and_right_node); + add_test_with_context( + suite, BinaryTree, + when_traversing_in_postorder_when_the_tree_has_multiple_levels); + + add_test_with_context(suite, BinaryTree, + when_traversing_inorder_when_the_tree_is_empty); + add_test_with_context( + suite, BinaryTree, + when_traversing_inorder_when_the_tree_has_a_single_node); + add_test_with_context(suite, BinaryTree, + when_traversing_inorder_when_the_tree_has_a_left_node); + add_test_with_context(suite, BinaryTree, + when_traversing_inorder_when_the_tree_has_a_right_node); + add_test_with_context( + suite, BinaryTree, + when_traversing_inorder_when_the_tree_has_a_left_and_right_node); + add_test_with_context( + suite, BinaryTree, + when_traversing_inorder_when_the_tree_has_multiple_levels); + + add_test_with_context(suite, BinaryTree, + when_finding_the_next_node_in_a_preorder_traversal); + add_test_with_context(suite, BinaryTree, + when_finding_the_next_node_in_a_inorder_traversal); + add_test_with_context(suite, BinaryTree, + when_finding_the_next_node_in_a_postorder_traversal); return suite; } -- cgit v1.2.3