NODE* Delete(NODE* root, int data) has been implemented but it seems that for the case when the node to be deleted has 2 child nodes (especially when it's near the leaf nodes) it fails.
This is the video that I have referred to implement the Binary Search Tree.

To replicate the effect: create the same BST as the example and try to delete the node -2 and then display it. It deletes node -4 properly however fails to delete node -2.

Will it ever be fixed? I wonder 🤔 .

The README may contain instructions on how to include and compile the header
For example

Here are complete steps to test ClearScreen on any Debian Based System:

1. Make a file test.c

#include<stdio.h>
#include"clearscreen.h"
int main(){
    printf("Hello");
    ClearScreen();
    printf("\nBitch It works\n");
}

2. Download and install the libncurses5-dev:
   sudo apt-get install libncurses5-dev

3. Compile using -lncurses flag
   gcc test.c clearscreen.c -lncurses -o test