(value string)
| 26 | } |
| 27 | |
| 28 | func (q *Queue) Push(value string) *Queue { |
| 29 | new_node := newNode(value, nil) |
| 30 | if q.Length == 0 { |
| 31 | q.head = new_node |
| 32 | } else { |
| 33 | q.tail.Next = new_node |
| 34 | } |
| 35 | q.tail = new_node |
| 36 | q.Length++ |
| 37 | return q |
| 38 | } |
| 39 | |
| 40 | // Removes a Node from the queue and returns it, |
| 41 | // Returns an error if there is no available node |