struct/practice.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
#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* insert(Node* root,int val){

  if(!root) return createNode(val);

  if(root->data > val){
    root->left = insert(root->left,val);
  }

  if(root->data < val){
    root->right = insert(root->right,val);
  }

  return root;

}

Node* createBT(int tree[],int i,int n){

  if(i >= n) return NULL;

  Node* root = createNode(tree[i]);

  root->left = createBT(tree,2*i+1,n);
  root->right = createBT(tree,2*i+2,n);

  return root;

}