Binary Tree deletion

tree.c

#include "tree.h"

Node* Tree_get_largest(Node* root) {
    Node* c = root;
    
    while (c->right)
        c = c->right;
    
    return c;
}

Node* Tree_delete_recursively(Node* node, int data) {
    if (!node) return NULL;
    
    if (data < node->data)
        node->left = Tree_delete_recursively(node->left, data);
    else if (data > node->data)
        node->right = Tree_delete_recursively(node->right, data);
    else {
        if (!node->left) {
            Node* tmp = node->right;
            free(node);
            return tmp;
        }
        
        if (!node->right) {
            Node* tmp = node->left;
            free(node);
            return tmp;
        }
        
        Node* largest = Tree_get_largest(node->left);
        node->data = largest->data;
        node->left = Tree_delete_recursively(node->left, largest->data);
    }
    
    return node;
}

void Tree_delete(Node* node, int data) {
    Tree_delete_recursively(node, data);    
}