Search:

Yes... but the tone of your comment makes me think I should do it again. I read it with the preconceived notion that I had to do the comparing.

for(int i=0;i<=100;i++)
{
n.number=random.nextInt(100); //add a random number to the node
n.visited = false;//set to false inside node
tree.put(n, i);//place node into tree
n=new...

I decided to learn a little more about TreeMap and I am having some issues and was hoping for some advice.



package org.search.BFS;

import java.util.Random;
import java.util.TreeMap;
...