Question

(Depth of a Binary Tree ) modify the tree class provides a method getDepth that determines how many levels are in the tree. Test the method in an application that inserts 20 random integers into a treee.

Answer 1

#include <stdio.h>
#include <stdlib.h>
#include <math.h>

struct node
{
    int data;
    struct node *left;
    struct node *right;
};
struct node *newNode(int data)
{
    struct node *temp = (struct node *)malloc(sizeof(struct node));
    temp->data = data;
    temp->left = temp->right = NULL;
    return temp;
}
int Max_depth(node *node)
{
    if (node == NULL)
        // NULL means that no node is present
        return 0;
    else
    {
        // compute maximum height in left- subtree
        int l = Max_depth(node->left);
        // compute the depth of the right sub tree
        int r = Max_depth(node->right);


        if (r > l)
            return(r + 1);
        else return(l  + 1);
    }
}
int main()
{
    struct node *root=NULL;
    root = newNode(10);
    root->left = newNode(20);
    root->right = newNode(30);
    root->left->left = newNode(40);
    root->right->left = newNode(50);
    root->left->right = newNode(90);
    root->right->right = newNode(30);
    root->right->right->left = newNode(88);
  int level =   Max_depth(root);
    printf( "The maximum level of the tree is: %d " , level  );




    return 0;
}