Write a C program to find the depth or height of a tree.
October 28, 2007 · Filed Under Placement Questions, Tree
 Don't want to miss a single bit? Subscribe By Email for Daily Jobs |
Here is some C code to get the height of the three
tree_height(mynode *p)
{
if(p==NULL)return(0);
if(p->left){h1=tree_height(p->left);}
if(p=>right){h2=tree_height(p->right);}
return(max(h1,h2)+1);
}
The degree of the leaf is zero. The degree of a tree is the max of its element degrees. A binary tree of height n, h > 0, has at least h and at most (2^h -1) elements in it. The height of a binary tree that contains n, n>0, elements is at most n and atleast log(n+1) to the base 2.
Log(n+1) to the base 2 = h
n = (2^h - 1)
Related Articles
- Write a C program to find the depth or height of a tree.
- Write C code to check if a given binary tree is a binary search tree or not?
- Write a C program to find the mininum value in a binary search tree.
- Write a C program to find the mininum value in a binary search tree.
- Write C code to return a pointer to the nth node of an inorder traversal of a BST.
-
Subscribe
-
Job In Companies
-
Latest Jobs- Religare Freshers Walkin Telemarketing Executive(Females Only)
- Aditya Freshers Walkin Nov 17 - 22
- Accenture Recruits Freshers
- Henix Soft Recruits Freshers Embedded Design Engineer
- INTEL Tech Recruits Freshers Server OPS Specialist
- Hewitt Recruits Fresher-B.Sc(IT, Computer Science), BCA-2007-2008 passout
- Sutherland Recruits Freshers Technical Support Executives
- Wipro Recruits Freshers
- Elico Freshers Walkin Nov 10 - 20
- Aditya Freshers Walkin Nov 10 - 14