struct/createBSTandprintRev.c at main · Quartz1605/struct · 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
#include<stdio.h>
#include<stdlib.h>


typedef struct Node{

  int data;
  struct Node* left;
  struct Node* right;

}Node;


Node* createNode(int data){

  Node* node = (Node*)malloc(sizeof(Node));
  node->data = data;
  node->left = NULL;
  node->right = NULL;

  return node;

}

Node* insertBST(Node* root,int data){

  if(root == NULL) return createNode(data);

  if(data < root->data){
    root->left = insertBST(root->left,data);
  }

  if(data > root->data){
    root->right = insertBST(root->right,data);
  }

  return root;

}

void inorder(Node* root){

  if(root ==  NULL) return;

  inorder(root->right);
  printf("%d ",root->data);
  inorder(root->left);

}


int main(){

  Node* root = NULL;

  root = insertBST(root,3);
  root = insertBST(root,4);
  root = insertBST(root,7);
  root = insertBST(root,2);
  root = insertBST(root,5);
  root = insertBST(root,8);
  root = insertBST(root,6);

  inorder(root);


}