Interested to Buy Any Domain ? << Click Here >> for more details...
Write code for finding depth of tree
- 2 Answers
- 6454 Views
- Adobe, I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / om
struct tree //creating structure
{
int data; //data field of node
struct tree *lchild,*rchild;//left child & right child of node
};
//for depth calculation
int depth(struct tree *p)
{
int l,r;
if(p!=NULL)
{
l=depth(p->lchild);
r=depth(p->rchild);
return (1+((l>r)?l:r));
}
return -1;
}
| Is This Answer Correct ? | 6 Yes | 0 No |
Answer / crispin
/*
* Simple tree node representation
*/
struct node_t {
struct node_t *left;
struct note_t *right;
};
/*
* Return the maximum depth of the tree given a pointer
* to its root node.
*/
unsigned int
tree_depth (node_t *root)
{
return (NULL == root) ? 0 :
MAX(tree_depth(root->left, root->right)+1);
}
| Is This Answer Correct ? | 3 Yes | 6 No |
What's a "sequence point"?
1.int a=10; 2.int b=20; 3. //write here 4.b=30; Write code at line 3 so that when the value of b is changed variable a should automatically change with same value as b. 5.
Write a program for print infinite numbers
Differentiate between declaring a variable and defining a variable?
Can one function call another?
What's a good way to check for "close enough" floating-point equality?
how does a general function , that accepts an array as a parameter, "knows" the size of the array ? How should it define it parameters list ?
shorting algorithmS
Can a pointer be null?
Write a c program to print the even numbers followed by odd numbers in an array without using additional array
How does pointer work in c?
How to print %d in output
C 
