public static void levelOrderTraversal(Node root)
	{
		int curlevel=0,nxtlevel=0;
		int position=noOfNodes(root)/2;
		if(root!=null)
		{
			q.add(root);
			curlevel++;
			while(!q.isEmpty())
			{
				Node temp=q.remove();
				curlevel--;
				System.out.print("\t"+temp.data);
				if(temp.left!=null)
				{
					nxtlevel++;
					q.add(temp.left);
				}
				if(temp.right!=null)
				{
					nxtlevel++;
					q.add(temp.right);
				}
				if(curlevel==0)
				{
					System.out.println("\n");
					curlevel=nxtlevel;
					nxtlevel=0;
							
				}
				
			}
		}
	}