This C program implements functions for a binary search tree (BST) data structure including node creation, insertion, deletion, balancing operations like rotation, and traversal methods. The key aspects are: 1. It defines a Data struct to represent nodes with fields like number, height, and pointers to left/right children and parent nodes. 2. Functions are implemented for creating nodes, inserting values, searching, deleting nodes, checking balance and performing rotations. 3. Traversal methods like preorder, inorder and postorder are provided to iterate through the tree. 4. A main loop allows the user to insert, delete nodes and view the tree using different traversals, checking balance after each operation.

1. #include<stdio.h>
#include<stdlib.h>
int breakloop = 0;
struct Data{
int number;
int height;
Data *left, *right, *parent;
}*root;
Data *createNode(int number, Data *parent){
Data *curr = (Data*)malloc(sizeof(Data));
curr->number = number;
curr->left = curr->right = NULL;
curr->parent = parent;
curr->height = 1;
return curr;
}
void push(Data **curr,int number, Data *parent){
if(!(*curr)){
(*curr) = createNode(number, parent);
if((*curr)->parent)
printf("parent : %dn", (*curr)->parent->number);
}
else if (number == (*curr)->number){
printf("Data can't samen");
return;
}
else if(number < (*curr)->number)
push(&(*curr)->left,number,(*curr));
else if(number > (*curr)->number)
push(&(*curr)->right,number,(*curr));
}
int max(int a, int b){
if(a<=b)
return b;
if(a>b)
return a;
}
void rotateLL(Data *curr){
Data *mid = curr->left;
Data *last = mid->left;
printf("curr : %dn",curr->number);
printf("mid : %dn",mid->number);
printf("last : %dn",last->number);
Data *temp = NULL;
if(mid->right){
printf("ada tempn");
temp = mid->right;
}
if(curr == root){
printf("masuk curr == rootn");
root = mid;
mid->right = curr;

2. curr->parent = mid;
curr->left = NULL;
}else{
printf("masuk curr != rootn");
mid->parent = curr->parent;
printf("mid->parent : %dn",curr->parent->height);
if(curr->parent->right->height == curr->height){
curr->parent->right = mid;
printf("parent->rightn");
}
else if(curr->parent->left->height == curr->height){
curr->parent->left = mid;
printf("parent->leftn");
}
curr->parent = mid;
mid->right = curr;
curr->left = NULL;
}
if(temp){
curr->left = temp;
temp->parent = curr;
}
}
void rotateRR(Data *curr){
Data *mid = curr->right;
Data *last = mid->right;
printf("curr : %dn",curr->number);
printf("mid : %dn",mid->number);
printf("last : %dn",last->number);
Data *temp = NULL;
if(mid->left){
printf("ada tempn");
temp = mid->left;
}
if(curr == root){
printf("masuk curr == rootn");
root = mid;
mid->left = curr;
curr->parent = mid;
curr->right = NULL;
}else{
printf("masuk curr != rootn");
mid->parent = curr->parent;
if(curr->parent->left->height == curr->height)
curr->parent->left = mid;
else if (curr->parent->right->height == curr->height)
curr->parent->right = mid;
curr->parent = mid;
mid->left = curr;
curr->right = NULL;
}
if(temp){
curr->right = temp;
temp->parent = curr;
}
}

3. void rotateLR(Data *curr){
Data *mid = curr->left;
Data *last = mid->right;
printf("curr : %dn",curr->number);
printf("mid : %dn",mid->number);
printf("last : %dn",last->number);
Data *temp = NULL;
if(last->left){
printf("ada tempn");
temp = last->left;
}
printf("masuk curr == rootn");
last->left = mid;
last->parent = curr;
curr->left = last;
mid->parent = last;
mid->right = NULL;
if(temp){
mid->right = temp;
temp->parent = mid;
}
}
void rotateRL(Data *curr){
Data *mid = curr->right;
Data *last = mid->left;
printf("curr : %dn",curr->number);
printf("mid : %dn",mid->number);
printf("last : %dn",last->number);
Data *temp = NULL;
if(last->right){
printf("ada tempn");
temp = last->right;
}
last->right = mid;
last->parent = curr;
curr->right = last;
mid->parent = last;
mid->left = NULL;
if(temp){
mid->left = temp;
temp->parent = mid;
}
}
int checkBalance(Data *curr){
int balance = 0;
if(!curr)
return 0;
checkBalance(curr->left);
checkBalance(curr->right);
if(breakloop != 0){
printf("Berhentin");
return 1;
}
if(!curr->left && !curr->right)
balance = 0;
else if(!curr->left){

4. balance = curr->right->height;
}
else if(!curr->right){
balance = curr->left->height;
}
else{
balance= curr->left->height - curr->right->height;
}
printf("%d->%dn",curr->number, balance);
if(balance <-1 || balance > 1){
if(curr->left && curr->left->left){
printf("Rotate LLn");
rotateLL(curr);
}else if(curr->right && curr->right->right){
printf("Rotate RRn");
rotateRR(curr);
}else if(curr->left && curr->left->right){
printf("Rotate LRn");
rotateLR(curr);
rotateLL(curr);
}else if(curr->right && curr->right->left){
printf("Rotate RLn");
rotateRL(curr);
rotateRR(curr);
}
breakloop = 1;
return 1;
}
return 0;
}
void checkHeight(Data *curr){
if(!curr)
return;
checkHeight(curr->left);
checkHeight(curr->right);
{
if(!curr->left && !curr->right)
curr->height = 1;
else if(!curr->left){
curr->height = 1 + curr->right->height;
}
else if(!curr->right){
curr->height = 1 + curr->left->height;
}
else{
curr->height = 1+ max(curr->left->height,curr->right->height);
}
printf("%d->%dn",curr->number,curr->height);
}
}
void postOrder(Data **curr){
if(!(*curr))
return;
postOrder(&(*curr)->left);
postOrder(&(*curr)->right);
printf("%d ",(*curr)->number);

5. }
void inOrder(Data **curr){
if(!(*curr))
return;
inOrder(&(*curr)->left);
printf("%d ",(*curr)->number);
inOrder(&(*curr)->right);
}
void preOrder(Data **curr){
if(!(*curr))
return;
printf("%d ",(*curr)->number);
preOrder(&(*curr)->left);
preOrder(&(*curr)->right);
}
int searchTF(int number, Data *curr){
if(!curr){
return 0;
}
else if(number == curr->number)
return 1;
else if(number< curr->number){
searchTF(number,curr->left);
}
else if(number > curr->number){
searchTF(number,curr->right);
}
}
Data *search(int number, Data *curr){
if(number == curr->number)
return curr;
else if(number< curr->number){
search(number,curr->left);
}
else if(number > curr->number){
search(number,curr->right);
}
}
void deleteTree(int delet, Data *curr){
printf("Delete %dn",curr->number);
if(!curr->left && !curr->right){
printf("!curr->left && !curr->rightn");
if(!curr->parent){
printf("Masuk !curr->parentn");
root = NULL;
free(curr);
}
else if(curr->parent->left && curr->parent->left->number == curr->number){
printf("curr->parent->left->number == curr->numbern");
curr->parent->left = NULL;
free(curr);
}

6. else if(curr->parent->right && curr->parent->right->number == curr-
>number){
printf("curr->parent->right->number == curr->numbern");
curr->parent->right = NULL;
free(curr);
}
}else if(curr->left && curr->right){
printf("curr->left && curr->rightn");
Data *swap = curr;
swap = swap->left;
printf("swap : %dn",swap->number);
while(swap->right != NULL){
swap = swap->right;
printf("swap : %dn",swap->number);
}
int temp = swap->number;
swap->number = curr->number;
curr->number = temp;
deleteTree(delet,swap);
}else if(curr->left){
printf("curr->leftn");
Data *swap = curr;
while(swap->left != NULL){
swap = swap->left;
int temp = swap->number;
swap->number = curr->number;
curr->number = temp;
}
deleteTree(delet,swap);
}else if(curr->right){
printf("curr->rightn");
Data *swap = curr;
while(swap->right != NULL){
swap = swap->right;
int temp = swap->number;
swap->number = curr->number;
curr->number = temp;
}
deleteTree(delet,swap);
}
printf("selesain");
}
int main(){
int choose = 0;
do{
choose = 0;
int chooseView = 0;
printf("1. Insertn");
printf("2. Deleten");
printf("3. Viewn");
printf("4. Exitn");
scanf("%d",&choose);
fflush(stdin);
switch(choose){
case 1:
int check;
check = 0;

7. int insert;
printf("Insert Number : ");
scanf("%d",&insert);
fflush(stdin);
push(&root,insert, NULL);
do{
breakloop = 0;
printf("Check Height: n");
checkHeight(root);
printf("Check Balance: n");
check = checkBalance(root);
printf("check : %dn",check);
}while(check != 0);
break;
case 2:
int delet;
printf("Delete Number : ");
scanf("%d",&delet);
fflush(stdin);
if(searchTF(delet,root) ==0)
printf("No Datan");
else if (searchTF(delet,root) == 1){
printf("Masuk deletn");
deleteTree(delet,search(delet,root));
}
do{
breakloop = 0;
printf("Check Height: n");
checkHeight(root);
printf("Check Balance: n");
check = checkBalance(root);
printf("check : %dn",check);
}while(check != 0);
break;
case 3:
do{
chooseView = 0;
printf("1. PreOrdern");
printf("2. InOrdern");
printf("3. PostOrdern");
printf("4. Exitn");
scanf("%d",&chooseView);
fflush(stdin);
switch(chooseView){
case 1:
preOrder(&root);
puts("");
break;
case 2:
inOrder(&root);
puts("");
break;
case 3:
postOrder(&root);
puts("");
break;
}
}while(chooseView != 4);

8. break;
}
}while(choose != 4);
return 0;
}