struct/BtLevelOrder.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
68
69
70
71
72
73
74
#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* createBT(int arr[],int i,int n){

  if(i >= n) return NULL;

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

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

  return root;

}

void levelTraversal(Node* root) {

  int front = 0;
  int rear = 0;

  Node* queue[100];

  queue[rear++] = root;

  while(front < rear){

    Node* curr = queue[front++];
    printf("%d ",curr->data);

    if(curr->left) queue[rear++] = curr->left;
    if(curr->right) queue[rear++] = curr->right;

  }

}

int main(){

  int arr[] = {1,2,3,4,5,6,7};
  int n = sizeof(arr)/sizeof(arr[0]);

  Node* root = createBT(arr,0,n);

  levelTraversal(root);


}


/