TREE PROBLEMS

1.write a program to compute the number of nodes in tree.

int size(struct node* node)
{
if(node==NULL)
return (0);
else
return (size(node->left)+1+size(node->right));
}

2.write a program to compute the maximum depth of the tree.

int maxdepth(struct node* node)
{

if(node==NULL)
return (0);
else
{
int left_Depth = maxDepth(node->left);
int right_Depth = maxDepth(node->right);

if(left_Depth>right_depth)
return (left_Depth+1);
else
return (right_Depth+1);
}

}