CareerCup

Yes... Thanks

geeksforgeeks.org/?p=646

int max(int a,int b)
{
if(a>b)
return a;
else return b;
}
int TREE(node *t) //node is the node of the tree contains data left pointer and right pointer
{
if (t==NULL)
return 0;
else return ( 1+ max( TREE left[t], TREE right[t]))
}

struct tree
{
   int data;
   struct tree *left;
   struct tree *right;
};

int depth = 0;
Depth(struct node *Root)
{
   int Level;
  
   if(Root == NULL) return;  
 
   Depth(Root->left,Level + 1);
   Depth(Root->right,Level + 1);

   if(depth < Level)
   {
      depth = Level;
   }
}

main()
{
   struct tree *Root;
   
   .........
   ........
   Some code for tree creation
   .........
   .........

   Depth(Root,0);

   printf("\n Depth of the tree is %d",depth);
}

depth ( root )
{
if ( root == Null)
System.out.println(" the depth is -1");
else
return ( 1 + max ( depth(left) , depth(right))
}