Double Link List

Double Link List

class Node(object):
    '''this is a node'''
    def __init__(self, elem):
        self.elem = elem
        self.next = None
        self.prev = None

class DoubleLinkList(object):
    '''this is a Double Linked List'''
    def __init__(self, node=None):
        self.__head = node

    def is_empty(self):
        '''Judge whether it is empty'''
        return self.__head is None

    def length(self):
        '''Length of linked list'''
        # cursor
        cur = self.__head
        # count
        count = 0
        while cur != None:
            count += 1
            cur = cur.next
        return count

    def travel(self):
        '''Traversing chain list'''
        cur = self.__head
        while cur != None:
            print(cur.elem, end=' ')
            cur = cur.next
        print('')


    def add(self, item):
        '''Add elements to linked list header'''
        node = Node(item)
        node.next = self.__head
        self.__head = node
        node.next.prev = node

    def append(self, item):
        '''Add elements to the end of the linked list'''
        node = Node(item)
        if self.is_empty():
            self.__head = node
        else:
            cur = self.__head
            while cur.next != None:
                cur = cur.next
            cur.next = node
            node.prev = cur

    def insert(self, pos, item):
        '''Add elements to specified locations'''
        if pos <= 0:
            self.add(item)
        elif pos > self.length():
            self.append(item)
        else:
            cur = self.__head
            count = 0
            while count < pos:
                count += 1
                cur = cur.next
            node = Node(item)
            node.next = cur
            node.prev = cur.prev
            cur.prev.next = node
            cur.prev = node


    def remove(self, item):
        '''Delete node'''
        cur = self.__head
        while cur != None:
            if cur.elem == item:
                if cur == self.__head:
                    self.__head = cur.next
                    if cur.next:
                        cur.next.prev = None
                    else:
                        self.__head = None
                else:
                    cur.prev.next = cur.next
                    if cur.next:
                        cur.next.prev = cur.prev
                    else:
                        cur.prev.next = None
                break
            else:
                cur = cur.next

    def search(self, item):
        '''Judge node existence'''
        cur = self.__head
        while cur != None:
            if cur.elem == item:
                return True
            else:
                cur = cur.next
        return False

def main():
    d1 = DoubleLinkList()
    print(d1.is_empty())
    d1.append(1)
    d1.append(2)
    d1.insert(1,3)
    d1.travel()
    print(d1.length())
    d1.travel()
    d1.remove(2)
    d1.remove(1)
    d1.travel()

if __name__ == '__main__':
    main()


---------------results of enforcement----------
True
1 3 2 
3
1 3 2 
3 

-----------------------------------------------