Ideal Queue implementation for a breadt-first binary tree traversal

Question

While solving this leetcode problem, I want to use breadth-first binary tree traversal.

I read that "BFT" should be implemented with a Queue, but which Queue im