CareerCup

int getMaxLevel(Node root){
	Queue q = new LinkedList<Node>();
	result = 0;
	
	if(root != null){
		q.add(root);
	}
	
	while(!q.isEmpty()){
		int tempLength = q.size();
		result = (tempLength > result)? tempLength : result;
		while(tempLength-- > 0){
			Node node = q.poll();
			if(node.left != null){
				q.add(node.left);
			}
			if(node.right != null){
				q.add(node.right);
			}
		}
	}
	return result;
}

Do a level order traversal and store with max at each level.

I am not clear about question. Could you please provide example for this problem ?

class LocalBST extends BinarySearchTree
{
	private class QNode{
		Node node;
		int level;
		QNode(Node n, int level)
		{
			this.node=n;
			this.level=level;
			
		}
	}
	
		
	public  int levelWithMaxNodes()
	{
		int maxCount=0, maxLevel=0;
		Queue<QNode> qu= new LinkedList<QNode>();
		
		qu.add(new QNode(root,0));
		
		int levelCount=0, prevLevel=0;
		while(!qu.isEmpty())
		{
			
			QNode qNode = qu.remove();
			if(qNode.level>prevLevel)
			{
				levelCount=0;
			}
			
			levelCount+=1;
			if(levelCount>maxCount) 
			{
				maxCount=levelCount;
				maxLevel=qNode.level;
			}
			
			
     		maxCount=Math.max(levelCount, maxCount);
			
			if (qNode.node.left!=null)
				qu.add(new QNode(qNode.node.left,qNode.level+1));
			if (qNode.node.right!=null)
				qu.add(new QNode(qNode.node.right,qNode.level+1));
				
			prevLevel=qNode.level;
		}
		return maxLevel;
		
	}
}