The height is $2$.
Let, $U$ & $V$ be two sets of vertices and $S\in U$. Then, all the vertices of $V$ are enqued making height = 1. All vertices are enqued because the graph is complete. After 1st dequeue, all vertices of $U$ are again enqued making height = 2. Now, all vertices have been into queue therefore no more increment in height possible.