c-programming-practice/binary-tree.c at main · sr-tamim/c-programming-practice · 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
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
#include <stdio.h>

typedef struct node
{
    int data;
    struct node *left;
    struct node *right;
} node;

node *create_node(int data)
{
    node *new_node = (node *)malloc(sizeof(node));
    if (new_node == NULL)
    {
        printf("Memory allocation failed\n");
        exit(1);
    }
    new_node->data = data;
    new_node->left = NULL;
    new_node->right = NULL;
    return new_node;
}

node *insert_node(node *root, int data)
{
    if (root == NULL)
    {
        return create_node(data);
    }
    if (data < root->data)
    {
        root->left = insert_node(root->left, data);
    }
    else
    {
        root->right = insert_node(root->right, data);
    }
    return root;
}

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

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

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

int delete_node(node *root, int data)
{
    if (root == NULL)
    {
        return 0;
    }
    if (root->data == data)
    {
        if (root->left == NULL && root->right == NULL)
        {
            free(root);
            return 1;
        }
        else if (root->left == NULL)
        {
            node *temp = root;
            root = root->right;
            free(temp);
            return 1;
        }
        else if (root->right == NULL)
        {
            node *temp = root;
            root = root->left;
            free(temp);
            return 1;
        }
        else
        {
            node *temp = root->right;
            while (temp->left != NULL)
            {
                temp = temp->left;
            }
            root->data = temp->data;
            delete_node(root->right, temp->data);
            return 1;
        }
    }
    if (root->data < data)
    {
        return delete_node(root->right, data);
    }
    return delete_node(root->left, data);
}

int search_node(node *root, int data)
{
    if (root == NULL)
    {
        return 0;
    }
    if (root->data == data)
    {
        return 1;
    }
    if (root->data < data)
    {
        return search_node(root->right, data);
    }
    return search_node(root->left, data);
}

int main()
{
    node *root = NULL;
    root = insert_node(root, 5);
    insert_node(root, 3);
    insert_node(root, 10);
    insert_node(root, 1);
    insert_node(root, 6);
    insert_node(root, 14);
    insert_node(root, 4);
    insert_node(root, 7);
    insert_node(root, 13);
    printf("Inorder traversal: ");
    inorder_traversal(root);
    printf("\n");
    printf("Preorder traversal: ");
    preorder_traversal(root);
    printf("\n");
    printf("Postorder traversal: ");
    postorder_traversal(root);
    printf("\n");
    //delete_node(root, 10);
    printf("Inorder traversal after deleting 10: ");
    inorder_traversal(root);
    printf("\n");
    printf("Is 7 present in the tree? %s\n", search_node(root, 7) ? "Yes" : "No");
    printf("Is 10 present in the tree? %s\n", search_node(root, 10) ? "Yes" : "No");
    printf("\n");
    return 0;
}