Binary-Tree/TREE_find_depth.c at master · saurabhs92/Binary-Tree · 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
91
92
93
94
95
96
97
98
#include<stdio.h>

typedef struct node
{
        int data;
        struct node *left;
        struct node *right;
}mynode;

void add(mynode **root, int value);
void inorder(mynode *root);
int find_maximum_depth(mynode *root);


int main()
{
    mynode *root;
    root = (mynode *)0;
    int depth;
    add(&root, 5);
    add(&root, 4);
    add(&root, 6);
    add(&root, 9);
    add(&root, 14);
    add(&root, 3);
    add(&root, 1);
    add(&root, 2);

    printf("\nInorder Transversal of tree: ");
    inorder(root);
    depth = find_maximum_depth(root);
    printf("\n\nDepth is: %d ", depth);

    getch();
    return 0;
}

void add(mynode **root, int value)
{
          mynode *temp, *prev, *curr;
          temp = malloc(sizeof(mynode));
          temp -> data = value;
          temp -> left = (mynode *)0;
          temp -> right = (mynode *)0;

          if(*root == (mynode *)0)
                   *root = temp;
          else
          {
                   prev = (mynode *)0;
                   curr = *root;

                   while(curr != (mynode *)0)
                   {
                              prev = curr;
                              curr = (value < curr -> data)? curr -> left : curr -> right;

                   }

                   if(value < prev -> data)
                            prev -> left = temp;
                   else
                            prev -> right = temp;
          }

}


void inorder(mynode *root)
{
     if(root != (mynode *)0)
     {
             inorder(root -> left);
             printf("%d ", root -> data);
             inorder(root -> right);
     }
}

int find_maximum_depth(mynode *root)
{

     if(root == (mynode *)0)        // must be at the beginning or won't work!
         return(0);
     else
     {

         int height1 = find_maximum_depth(root -> left); // must be inside else
         int height2 = find_maximum_depth(root -> right);


         if(height1 < height2)
                    return(height2 + 1);
         else
                    return(height1 + 1);

     }

}