Data-Structures/TREES/BINARY-TREE/C/printLevelorder.c at master · Anonymous866/Data-Structures · 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
#include<stdio.h>
#include<malloc.h>

struct Node
{
  int data;
  struct Node *left,*right;
};


void printGivenLevel(struct Node* root, int level);
int height (struct Node * node);

struct Node * newNode(int data);

void printLevelOrder(struct Node * root)
{
  int h = height(root);
  int i;

  for(i = 1; i<= h ; i++)
  {
    printGivenLevel(root,i);
  }
}

void printGivenLevel(struct Node * root,int level)
{
  if(root == NULL)
  {
    return;
  }
  if(level == 1)
  {
    printf("%d",root->data);

  }
  else if(level > 1)
  {
    printGivenLevel(root->left , level -1);
    printGivenLevel(root->right , level -1);
  }
}

int height(struct Node * node)
{
  if(node == NULL)
  {
    return 0;
  }
  else
  {
    int lheight = height(node->left);
    int rheight = height(node->right);


    if(lheight > rheight)
    {
      return lheight+1;
    }
    else
    {
      return rheight+1;
    }
  }
}
struct Node* newNode(int data)
{
    struct Node* node = (struct Node*)
                        malloc(sizeof(struct Node));
    node->data = data;
    node->left = NULL;
    node->right = NULL;

    return(node);
}
int main()
{
  struct Node *root = newNode(1);
    root->left        = newNode(2);
    root->right       = newNode(3);
    root->left->left  = newNode(4);
    root->left->right = newNode(5);

    printf("Level Order traversal of binary tree is \n");
    printLevelOrder(root);

    return 0;
}