Please help a newbie with simple equal methode

Question

With my little know how of java I have written this methode
to test the equality of two LinkedSet data structures.
provided that the linkedSet class and the iterator are
implemented correctly , can some one help me please to
figure out what is wrong or give an alternate solution.
Thanks in advance
* Return true if this set and the parameter contain
* exactly the same elements
public boolean equals(SetADT setADT) throws IllegalStateException
boolean result=false;
if(this.size()!=setADT.size())
throw new IllegalStateException(" Two sets are not equal");
Iterator a=this.iterator();
Iterator b=setADT.iterator();
LinkedSet temp1=new LinkedSet();
LinkedSet temp2=new LinkedSet();
while(a.hasNext())
temp1.add(a.next());
temp2.add(b.next());
Iterator c=temp1.iterator();
Iterator d=temp2.iterator();
if(c.next().equals(d.next()))
temp1.remove(c.next());
temp2.remove(d.next());
result=(temp1.isEmpty()&&temp2.isEmpty());
return result;

Answer 1

while(a.hasNext())
  temp1.add(a.next());
  temp2.add(b.next());
  Iterator c=temp1.iterator();
  Iterator d=temp2.iterator();
  if(c.next().equals(d.next())) // <- Watch missing braces !
     temp1.remove(c.next());
  temp2.remove(d.next());
  result=(temp1.isEmpty()&&temp2.isEmpty());
}Whay are you doing all that extra iteration stuff?
I mean, I see what you are getting at ...towards the empty final objects. But isn't that a really exhaustive way the get to the end of this problem? The end doesn't justify the means.
Start assuming result = true
In your while loop...
Just test 'if (!(a.next().equals(b.next())) {'
If it ever does, something didn't match.
So set result = false and 'break' from the loop.
At the end of the method, result will be either true or false accordingly.
Code that up and it should work better. But ...can we assume the iterators traverse the set in the same order always? That is the question I would ask here.