/* Nonrecursive method to do inorder tree traversal */
	private void stackInorder(BinaryNode t)
	{
		StackAr stack = new StackAr();
		
		stack.push(t);
		while (!stack.isEmpty())
		{
			if (t != null)
			{
				t = t.left;
				if (null != t)
					stack.push(t);
			}
			else
			{
				t = (BinaryNode) stack.pop();
				System.out.println(t.element);
				t = t.right;
				if (t != null) stack.push(t);
			} // end else
		} // end while

	} // end stackInorder