HI, I have an excersise for school but don't know if I solve it correctly so maybe is here a good place for my questions.
It's a Breadth-first search algorithm. here is a picture. http://www.shrani.si/f/2b/SK/2SKKVUSy/drawing1.jpg
now I have to resolve these (start with node 2) :
This is my table : http://www.shrani.si/f/41/vj/renxwxg/jsdfgs.jpg
I don't know which number have son(child) and I'm not sure if queue is correct. Tnx for help.