Data_Structure/BST.c at master · HarshAditya23/Data_Structure · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
#include<stdio.h>
#include<stdlib.h>

struct node
{
    int key;
    struct node *left, *right;
};


struct node *newNode(int item)
{
    struct node *temp =  (struct node *)malloc(sizeof(struct node));
    temp->key = item;
    temp->left = temp->right = NULL;
    return temp;
}


void inorder(struct node *root)
{
    if (root != NULL)
    {
        inorder(root->left);
        printf("%d \n", root->key);
        inorder(root->right);
    }
}

 struct node* insert(struct node* node, int key)
{
     if (node == NULL) return newNode(key);

     if (key < node->key)
        node->left  = insert(node->left, key);
    else if (key > node->key)
        node->right = insert(node->right, key);

     return node;
}


int main()
{

    struct node *root = NULL;
    root = insert(root, 23);
    insert(root, 22);
    insert(root, 24);
    insert(root, 26);
    insert(root, 18);
    insert(root, 43);
    insert(root, 13);


    inorder(root);

    return 0;
}