Problem Statement

BFS Queue Contents When Node J Is Enqueued Consider the tree given by root node A, A's Children B, C, D, E; C's Children F, G, H; D's Children I, J and E's Child K. Breadth-First search is done using a Queue. Describe the queue, writing the first-in nodes leftmost when J is encountered and inserted.