Question

Using C Please comment

Part 1: BST Create a link based Binary Search tree composed of a Node and a Tree struct. You should have a header file, BST.h, with the following: o Node struct containing left, right, and parent pointers, in addition to holding an Data struct value Tree struct containing a pointer to the root of the tree A function declaration for a function that allocates a tree, and initializes the root to NULL o o o A function declaration for a function that takes a Data struct as a parameter, allocates a node, and initializes the left, right, parent fields to NULL You should also have a source file, BST.c, that implements the two declared functions o Tree createTree): o Node createNode); Test your functions and structure to ensure everything is initialized correctly by creating a Tree and adding a root to it Part 2: BST Operations Alter your header file to contain the function declarations for insert and search. Implement the operations in your BST.c file. · INSERT o Create a function, void insert(Tree bst, Data value), that inserts into the tree - Helpful hints Make sure you check for the special case of an empty tree [if(bst->root NULL). After checking for the root, use a separate helper function to insert a value into the tree, void insertNode(Node can use for the recursive call node, Data value), that you If the value is already in the tree, just print a message that you cannot o Create a function, Node search(Tree bst, Data value), that searches for a insert duplicate values SEARCH value in the tree. You only need to print out if the value is found or not- Helpful hints: Make sure you check for the special case of an empty tree [if(bst->root NULL) After checking for the root, use a separate helper function to search the tree, Node searchNode(Node node, Data value), that you can use for the recursive call

Answer 1

here is the answer.........

#include<stdio.h>
#include<stdlib.h>
  
struct node
{
    int data;
    struct node* left;
    struct node* right;
};

struct node* createNode(value){
    struct node* newNode = malloc(sizeof(struct node));
    newNode->data = value;
    newNode->left = NULL;
    newNode->right = NULL;

    return newNode;
}
  
  
struct node* insert(struct node* root, int data)
{
    if (root == NULL) return createNode(data);

    if (data < root->data)
        root->left  = insert(root->left, data);
    else if (data > root->data)
        root->right = insert(root->right, data);   
 
    return root;
}

void inorder(struct node* root){
    if(root == NULL) return;
    inorder(root->left);
    printf("%d ->", root->data);
    inorder(root->right);
}


int main(){
    struct node *root = NULL;
    root = insert(root, 8);
    insert(root, 3);
    insert(root, 1);
    insert(root, 6);
    insert(root, 7);
    insert(root, 10);
    insert(root, 14);
    insert(root, 4);

    inorder(root);
}