Question

NEED HELP IN C!! Answer in C programming language.

Question:

For the assignment use the following structs for Binary Trees and Binary Search Trees. struct Binode { int value; struct Binode* left; struct BTnode* right; struct BTnode* parent; }; typedef struct Binode BTnode_t; typedef struct BST { BTnode_t* root; BST_t;

Functions and .h file:

Test function:

part 1:

part 2:

Answer 1

int get_sum(BTnode_t *tree) {
    if (tree == NULL) {
        return 0;
    } else {
        return tree->value + get_sum(tree->left) + get_sum(tree->right);
    }
}

int get_min(BST_t *tree) {
    BTnode_t *temp = tree->root;
    while (temp->left != NULL) {
        temp = temp->left;
    }
    return temp->value;
}