type ListNode struct {
    Value interface{}
    Prev  *ListNode
    Next  *ListNode
}
<p>type DoublyLinkedList struct {
Head <em>ListNode
Tail </em>ListNode
Size int
}</p>

func (list *DoublyLinkedList) Append(value interface{}) {
    newNode := &ListNode{Value: value}
    if list.Size == 0 {
        list.Head = newNode
        list.Tail = newNode
    } else {
        newNode.Prev = list.Tail
        list.Tail.Next = newNode
        list.Tail = newNode
    }
    list.Size++
}

func (list *DoublyLinkedList) Remove(node *ListNode) {
    if node == nil {
        return
    }
    if node.Prev != nil {
        node.Prev.Next = node.Next
    } else {
        list.Head = node.Next // 删除的是头节点
    }
    if node.Next != nil {
        node.Next.Prev = node.Prev
    } else {
        list.Tail = node.Prev // 删除的是尾节点
    }
    node.Prev = nil
    node.Next = nil
    list.Size--
}

// 正向遍历
func (list *DoublyLinkedList) Tr*erse() {
    for curr := list.Head; curr != nil; curr = curr.Next {
        fmt.Println(curr.Value)
    }
}
<p>// 反向遍历
func (list *DoublyLinkedList) ReverseTr*erse() {
for curr := list.Tail; curr != nil; curr = curr.Prev {
fmt.Println(curr.Value)
}
}</p>