Node will be store the value and the next node as well
| 11 | |
| 12 | // Node will be store the value and the next node as well |
| 13 | type Node struct { |
| 14 | Data any |
| 15 | Next *Node |
| 16 | } |
| 17 | |
| 18 | // Queue structure is tell us what our head is and what tail should be with length of the list |
| 19 | type Queue struct { |
nothing calls this directly
no outgoing calls
no test coverage detected