LinkedList name = new LinkedList<>()
how does this work?
Level Order Traversal LinkedList
Since we need a queue for Level order traversal, we can either create a queue data structure separately, which will take a lot of time, or we can use a LinkedList as a queue. So, if we see the properties of a queue, it supports Last In, Last Out i.e all new elements are added at the end of the queue and an element leaves from the front of the queue. So if we use only these 2 functions on a LinkedList i.e addLast() and removeFirst(), then this LinkedList will essentially act as a queue. That is what is being done here.
LinkedList<Node> queue = new LinkedList<>();
This is a linked list named queue and using limited functions on it, we are making it behave like an actual queue.
I hope this is what you asked and I’ve not misunderstood your question.
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.