C Program to Print Height and Depth of Binary Tree

This C Program print height and depth of given binary tree.

Here is source code of the C Program to print height and depth of given binary tree. The C program is successfully compiled and run on a Linux system. The program output is also shown below.

```
/*
```

 * C Program to Print Height and Depth of given Binary Tree

 *                                        50

 *                                       /  \

 *                                      20   30

 *                                     /  \

 *                                    70  80

 *                                   / \    \

 *                                  10  40   60

```
 */    
```
```
#include <stdio.h>
```
```
#include <stdlib.h>
```
```
 
```
```
struct btnode {
```
```
    int value;
```
```
    struct btnode *l;
```
```
    struct btnode *r;
```
```
};
```
```
struct btnode *root;
```
```
typedef struct btnode bt;
```
```
bt *new,*ptr,*ptr1,*ptr2;
```
```
 
```
```
bt* create()
```
```
{
```
```
    new = (bt *)malloc(sizeof(bt));
```
```
    new->l = NULL;
```
```
    new->r = NULL;
```
```
    return new;
```
```
}
```
```
 
```
```
void construct_binary_tree()
```
```
{
```
```
    root = create();
```
```
    root->value = 50;
```
```
 
```
```
    ptr = create();
```
```
    root->l = ptr;
```
```
    ptr->value = 20;
```
```
 
```
```
    ptr1 = create();
```
```
    ptr->l = ptr1;
```
```
    ptr1->value = 70;
```
```
 
```
```
    ptr2 = create();
```
```
    ptr1->l = ptr2;
```
```
    ptr2->value = 10;
```
```
 
```
```
    ptr2 = create();
```
```
    ptr1->r = ptr2;
```
```
    ptr2->value = 40;
```
```
 
```
```
    ptr1 = create();
```
```
    ptr->r = ptr1;
```
```
    ptr1->value = 80;
```
```
 
```
```
    ptr2 = create();
```
```
    ptr1->r = ptr2;
```
```
    ptr2->value = 60;
```
```
 
```
```
    ptr = create();
```
```
    root->r = ptr;
```
```
    ptr->value = 30;
```
```
}
```
```
 
```
```
void main()
```
```
{
```
```
    int depth1 = 0, depth2 = 0;
```
```
 
```
```
    construct_binary_tree();
```
```
    ptr = root;
```

    while (ptr->l != NULL || ptr->r != NULL)

```
    {
```
```
        depth1++;
```
```
        if (ptr->l == NULL)
```
```
            ptr = ptr->r;
```
```
        else
```
```
            ptr = ptr->l;
```
```
    }
```
```
    ptr = root;    
```

    while (ptr->l != NULL || ptr->r != NULL)

```
    {
```
```
        depth2++;
```
```
        if (ptr->r == NULL)
```
```
            ptr = ptr->l;
```
```
        else
```
```
            ptr = ptr->r;
```
```
    }
```
```
/*
```

 *DEPTH IS CONSIDERED FROM LEVEL-0 ALSO HEIGHT IS CONSIDERED AS NUMBER OF EDGES

```
 */
```
```
    if (depth1 > depth2)
```

        printf("height of the tree is %d\ndepth of the tree is %d",depth1,depth1);

```
    else    
```

        printf("height of the tree is %d\ndepth of the tree is %d",depth2,depth2);

```
}
```

$ cc tree18.c
$ a.out
height of the tree is 3
depth of the tree is 3

Sanfoundry Global Education & Learning Series – 1000 C Programs.

Sanfoundry Certification Contest of the Month is Live. 100+ Subjects. Participate Now!

Here’s the list of Best Books in C Programming, Data-Structures and Algorithms

If you wish to look at programming examples on all topics, go to C Programming Examples.

« Prev - C Program to Print Border of given Tree in Anticlockwise Direction

» Next - C Program to Find Maximum Distance Between Two Nodes in a Binary Tree

Next Steps:

Get Free Certificate of Merit in Data Structure I
Participate in Data Structure I Certification Contest
Become a Top Ranker in Data Structure I
Take Data Structure I Tests
Chapterwise Practice Tests: Chapter 1, 2, 3, 4, 5, 6, 7, 8, 9, 10
Chapterwise Mock Tests: Chapter 1, 2, 3, 4, 5, 6, 7, 8, 9, 10

Related Posts:

Recommended Articles: