CareerCup

/* height of Binary tree recursively */
	private static Integer heightRecursively(BinaryTreeNode root) {
		int leftHeight, rightHeight;
		if (root == null)
			return 0;
		else {
			leftHeight = heightRecursively(root.getLeft());
			rightHeight = heightRecursively(root.getRight());
			if (leftHeight > rightHeight)
				return leftHeight + 1;
			else
				return rightHeight + 1;
		}
	}

int height(struct node* node)
{
if (node==NULL)
return 0;
else
{
/* compute the height of each subtree */
int lheight = height(node->left);
int rheight = height(node->right);
if (lheight > rheight)
return(lheight+1);
else return(rheight+1);
}
}

Frequently asked adobe question: Given a preorder and post order traversal construct a tree
anandtechblog.blogspot.com/2011/06/construct-given-tree-from-pre-order-and.html

<pre lang="" line="1" title="CodeMonkey67319" class="run-this">int height(node *head){
if(head==NULL)
return 0;
return max(height(head->left),height(head->right));
}</pre><pre title="CodeMonkey67319" input="yes">
</pre>

height_of_tree(temp)
{
if(temp==NULL)
return 0;

left=height_of_tree(temp->left);
right=height_of_tree(temp->right);
return (1+max(left,right);
}

Code for n-ary tree

public static void nAryTreeHeight(Node n) {
		if(n==null) {
			return 0;
		}
		int mh = 0;
		for(Node c : n.getChildren()) {
			mh = Math.max(mh, nAryTreeHeight(c) );
		}
		return mh+1;
	}