public void levelOrder(Node<Character> n)
	{
		LinkedList<Character> l1 = new LinkedList<Character>();
		LinkedList<Character> lfinal = new LinkedList<Character>();

		l1.addFirst(n.cont);		// head
		Node<Character> x = n;
		while(!l1.isEmpty())
		{
			if(x.left != null)
				l1.add(x.left);

			if(x.right != null)
				l1.add(x.right);

			lfinal.add(l1.getFirst());
			l1.removeFirst();
			x = l1.getFirst();
		}