#include<stdio.h>#include<stdlib.h>typedef struct node{ struct node * left; int data; struct node * right;}NODE;… scanf("%d",&num); if( num == -1) break; createBst(&root , num); } printMinimumMaximum(root);return 0;}

It seems like you've pasted a part of a C program code related to Binary Search Tree (BST) but it's incomplete and not properly formatted. It's hard to understand what you're asking without a specific question. Could you please provide more details or clarify your question?