-
Notifications
You must be signed in to change notification settings - Fork 0
/
BinaryTree1.c
62 lines (50 loc) · 1.05 KB
/
BinaryTree1.c
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
#include<stdio.h>
#include<stdlib.h>
typedef struct BinaryTree{
int data;
struct BinaryTree* left;
struct BinaryTree* right;
} btree;
btree* createBinaryTree(btree *root){
root=NULL;
return root;
}
void inorder(btree* root){
if(root!=NULL){
inorder(root->left);
printf("%d\n",root->data);
inorder(root->right);
}
}
btree* newNode(int data ){
btree *ptr=(btree*)malloc(sizeof(btree));
ptr->data=data;
ptr->left=NULL;
ptr->right=NULL;
return ptr;
}
btree* add(btree* root){
int val;
printf("Enter the Value");
scanf("%d",&val);
btree* ptr=newNode(val);
if(val==-1){
return NULL;
}else{
root=ptr;
printf("Enter Left child of it:");
root->left=add(root->left);
printf("Enter the right child of it:");
root->right=add(root->right);
return root;
}
}
int main(){
btree* root;
int value;
root=createBinaryTree(root);
root=add(root);
printf("EHlloo bro\n");
inorder(root);
return 0;
}