insert_before (ref_node, new_node ) elif operation = 'remove': insert_after (ref_node, new_node ) elif suboperation = 'before':Ī_cdllist. Print ( 'No such index.' ) continue if suboperation = 'after':Ī_cdllist. insert_at_beg (new_node ) elif position = 'end':Ī_cdllist. lower ( ) if suboperation = 'at':Ī_cdllist. first is None:Ī_cdllist = CircularDoublyLinkedList ( ) print ( 'Menu' ) print ( 'insert after ' ) print ( 'insert before ' ) print ( 'insert at beg' ) print ( 'insert at end' ) print ( 'remove ' ) print ( 'quit' ) while True:ĭo = input ( 'What would you like to do? ' ). next def display ( self ): # This method is for showing elements present in the list if self. first = new_nodeĭef remove ( self, node ): #This method is for deleting elements from the list if self. prev, new_node ) def insert_at_beg ( self, new_node ): #This method is for inserting elements into the list when the user selects insert at beginning option self. prev, new_node ) def insert_at_end ( self, new_node ): #This method is for inserting elements into the list when the user selects insert at end option if self. first:ĭef insert_after ( self, ref_node, new_node ): #This method is for inserting elements into the list when the user selects insert after optionĭef insert_before ( self, ref_node, new_node ): #This method is for inserting elements into the list when the user selects insert before option self. first for i in range (index ):Ĭurrent = current. first = None def get_node ( self, index ):Ĭurrent = self. prev = None class CircularDoublyLinkedList:
0 Comments
Leave a Reply. |