python数据结构学习笔记-4-链表

链表

本章内容易懂，书上有图解说明和完整代码，记录下来供参考就好了。

单链表实现堆栈

class Empty(Exception):
    pass

class LinkedStack:
    """LIFO Stack implementation using a singly linked list for storage."""
    class _Node:
        """Lightweight nonpublic class for storing a singly linked node."""
        __slots__ = '_element', '_next'                 #streamline memory usage

        def __init__(self, element, next):                #initialize node's fields
            self._element = element                       #reference to user's element
            self._next = next                             #reference to next node

    def __init__(self):
        """Create an empty stack."""
        self._head = None                          #reference to the head node
        self._size = 0                             #number of stack elements

    def __len__(self):
        """Return the number of elements in the stack."""
        return self._size

    def is_empty(self):
        """Return True if the stack is empty."""
        return self._size == 0

    def push(self,e):
        """Add element e to the top of the stack."""
        self._head = self._Node(e,self._head)          #create and linked a new node
        self._size += 1

    def top(self):
        """Return (but do not remove) the element at the top of the stack.
        Raise Empty exception if the stack is empty.
        """
        if self.is_empty():
            raise Empty('Stack is empty')
        return self._head._element

    def pop(self):
        """Remove and return the element from the top of the stack(i.e., LIFO).
        Raise Empty exception if the stack is empty.
        """
        if self.is_empty():
            raise Empty('Stack is empty')
        answer = self._head._element
        self._head = self._head._next                        #bypass the fromer top node
        self._size -= 1
        return answer

单链表实现队列

class LinkedQueue:
    """FIFO queue implementation using a singly linked list for storage."""

    class _Node:
        """Lightweight, nonpublic class for storing a singly lined node."""
        __slots__ = '_element', '_next'                 #streamline memory usage

        def __init__(self, element, next):                #initialize node's fields
            self._element = element                       #reference to user's element
            self._next = next                             #reference to next node

    def __init__(self):
        """Create an empty queue."""
        self._head = None
        self._tail = None
        self._size = 0                                #number of queue elements

    def __len__(self):
        """Return the number of elements in the queue."""
        return self._size