通过python实现数据结构（一）

#单链表

class SingleNode(object):
    def __init__(self, item):
        self.elem = item
        self.next = None


class SingleLinkList(object):

    def __init__(self, node=None):
        # 头结点对外不公布
        self._head = node

    def is_empty(self):
        return self._head is None

    def length(self):
        cur = self._head
        count = 0
        while cur is not None:
            count += 1
            cur = cur.next
        return count

    def travel(self):
        cur = self._head
        while cur is not None:
            print(cur.elem)
            cur = cur.next
    # 遍历整个列表

    def add(self, item):
        pass

    def append(self, item):
        node = SingleNode(item)
        if self.is_empty():
            self._head = node
        else:
            cur = self._head
            while cur.next is not None:
                cur = cur.next
            cur.next = node

    def insert(self, pos, item):
        pass
    # 在指定位置添加元素

    def remove(self, item):
        pass

    def search(self, item):
        pass