80 lines
1.6 KiB
C
80 lines
1.6 KiB
C
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include "bintree.h"
|
|
#include "unity.h"
|
|
|
|
|
|
void sizeTest()
|
|
{
|
|
TreeNode *root = (TreeNode *)malloc(sizeof(TreeNode));
|
|
TreeNode *node1 = (TreeNode *)malloc(sizeof(TreeNode));
|
|
TreeNode *node2 = (TreeNode *)malloc(sizeof(TreeNode));
|
|
|
|
int dataRoot = 2;
|
|
int dataNode1 = 1;
|
|
int dataNode2 = 3;
|
|
|
|
root->data = &dataRoot;
|
|
root->left = (TreeNode *)node1;
|
|
root->right = (TreeNode *)node2;
|
|
|
|
node1->data = &dataNode1;
|
|
node1->left = NULL;
|
|
node1->right = NULL;
|
|
|
|
node2->data = &dataNode2;
|
|
node2->left = NULL;
|
|
node2->right = NULL;
|
|
|
|
TEST_ASSERT_EQUAL_INT(3,treeSize(root));
|
|
}
|
|
|
|
void clearTest()
|
|
{
|
|
TreeNode *root = (TreeNode *)malloc(sizeof(TreeNode));
|
|
TreeNode *node1 = (TreeNode *)malloc(sizeof(TreeNode));
|
|
TreeNode *node2 = (TreeNode *)malloc(sizeof(TreeNode));
|
|
|
|
int dataRoot = 2;
|
|
int dataNode1 = 1;
|
|
int dataNode2 = 3;
|
|
|
|
root->data = &dataRoot;
|
|
root->left = (TreeNode *)node1;
|
|
root->right = (TreeNode *)node2;
|
|
|
|
node1->data = &dataNode1;
|
|
node1->left = NULL;
|
|
node1->right = NULL;
|
|
|
|
node2->data = &dataNode2;
|
|
node2->left = NULL;
|
|
node2->right = NULL;
|
|
|
|
TreeNode *ptr = root;
|
|
|
|
clearTree(ptr);
|
|
TEST_ASSERT_EQUAL_INT(0,treeSize(root));
|
|
}
|
|
|
|
void setUp(void)
|
|
{
|
|
// Falls notwendig, kann hier Vorbereitungsarbeit gemacht werden
|
|
}
|
|
|
|
void tearDown(void)
|
|
{
|
|
// Hier kann Bereinigungsarbeit nach jedem Test durchgeführt werden
|
|
}
|
|
|
|
int main()
|
|
{
|
|
UNITY_BEGIN();
|
|
|
|
printf("============================\nNumbers tests\n============================\n");
|
|
|
|
RUN_TEST(sizeTest);
|
|
RUN_TEST(clearTest);
|
|
|
|
return UNITY_END();
|
|
} |