enqueue it will be added new value into queue
(n any)
| 24 | |
| 25 | // enqueue it will be added new value into queue |
| 26 | func (ll *Queue) enqueue(n any) { |
| 27 | var newNode Node // create new Node |
| 28 | newNode.Data = n // set the data |
| 29 | |
| 30 | if ll.tail != nil { |
| 31 | ll.tail.Next = &newNode |
| 32 | } |
| 33 | |
| 34 | ll.tail = &newNode |
| 35 | |
| 36 | if ll.head == nil { |
| 37 | ll.head = &newNode |
| 38 | } |
| 39 | ll.length++ |
| 40 | } |
| 41 | |
| 42 | // dequeue it will be removed the first value into queue (First In First Out) |
| 43 | func (ll *Queue) dequeue() any { |