cod3smith

import heapq

class PriorityQueue:
    def __init__(self):
        self.items = []
        self.count = 0

    def enqueue(self, item, priority):
        heapq.heappush(self.items, (priority, self.count, item))
        self.count += 1

cod3smith

package main

import "container/heap"

type Item struct {
	value    interface{}
	priority int
	index    int
}

cod3smith

from collections import deque

class Deque:
    def __init__(self):
        self.items = deque()

    def add_front(self, item):
        self.items.appendleft(item)

    def add_rear(self, item):

cod3smith

package main

type Deque struct {
	items []interface{}
}

func NewDeque() *Deque {
	return &Deque{
		items: make([]interface{}, 0),
	}

cod3smith

class Node:
    def __init__(self, data):
        self.data = data
        self.next = None

class SinglyLinkedList:
    def __init__(self):
        self.head = None

    def is_empty(self):

cod3smith

package main

import "fmt"

type Node struct {
    data interface{}
    next *Node
}

type SinglyLinkedList struct {

cod3smith

class Node:
    def __init__(self, data):
        self.data = data
        self.prev = None
        self.next = None

class DoublyLinkedList:
    def __init__(self):
        self.head = None

cod3smith

package main

import "fmt"

type Node struct {
    data interface{}
    prev *Node
    next *Node
}

cod3smith

class Node:
    def __init__(self, data):
        self.data = data
        self.next = None

class CircularLinkedList:
    def __init__(self):
        self.head = None

    def is_empty(self):

cod3smith

package main

import "fmt"

type Node struct {
    data interface{}
    next *Node
}

type CircularLinkedList struct {