Mercurial > hg > CbC > old > akasha
changeset 44:3e6cd523bf6d
Delete C function converted CS
author | atton |
---|---|
date | Sun, 19 Jun 2016 06:43:25 +0000 |
parents | 23b9717a5c14 |
children | 517d1108f91f |
files | src/insert_verification/verifySpecification.c |
diffstat | 1 files changed, 0 insertions(+), 31 deletions(-) [+] |
line wrap: on
line diff
--- a/src/insert_verification/verifySpecification.c Thu Jun 16 07:23:27 2016 +0000 +++ b/src/insert_verification/verifySpecification.c Sun Jun 19 06:43:25 2016 +0000 @@ -4,37 +4,6 @@ extern void allocator(struct Context*); -/* C functions (TODO: convert to code segment) */ - -unsigned int min_height(struct Node* node, unsigned int height) { - if ((node->left == NULL) && (node->right == NULL)) return height; - if (node->left == NULL) return min_height(node->right, height+1); - if (node->right == NULL) return min_height(node->left, height+1); - - unsigned int left_min = min_height(node->left, height+1); - unsigned int right_min = min_height(node->right, height+1); - - if (left_min < right_min) { - return left_min; - } else { - return right_min; - } -} - -unsigned int max_height(struct Node* node, unsigned int height) { - if ((node->left == NULL) && (node->right == NULL)) return height; - if (node->left == NULL) return max_height(node->right, height+1); - if (node->right == NULL) return max_height(node->left, height+1); - - unsigned int left_max = max_height(node->left, height+1); - unsigned int right_max = max_height(node->right, height+1); - - if (left_max > right_max) { - return left_max; - } else { - return right_max; - } -} void printTree(struct Node* node, int n) { if (node != 0) { printTree(node->left, n+1);