elif menu == Menu.꼬리노드삭제: lst.remove_last() elif menu == Menu.주목노드출력: lst.print_current_node() elif menu == Menu.주목노드이동: lst.next() elif menu == Menu.주목노드삭제: lst.remove_current_node() elif menu == Menu.모든노드삭제: lst.clear() elif menu == Menu.검색: find = lst.search(int(input('검색할 노드를 입력해주세요 : '))) if find >= 0: print(f"노드는 {find + 1}번째에 있습니다.") else: print('찾고자하는 노드가 없습니다') elif mnue == Menu.모든노드출력: lst.print() elif menu == Menu.스캔: for m in lst: print(m) else: break
# itr = itr.prev # return print('Doubly Linked List in reverse: ', revs) if __name__ == '__main__': # dll = DoublyLinkedList() # dll.print() # dll.insert_at_beginning(30) # dll.print() # dll.insert_at_beginning(10) # dll.print() # dll.insert_at_end(40) # dll.print() # dll.insert_at(20, 1) # dll.print() # dll.insert_at_end(50) # dll.print() # dll.insert_at(25,2) # dll.print() # dll.remove_at(2) # dll.print() # dll.insert_after_value(40, 45) # dll.print() # dll.remove_by_value(45) # dll.print() # dll.print_forward() # dll.print_reverse() ll = LinkedList() ll.insert_values([1, 2, 3, 4, 5, 6]) ll.print() ll.insert_at(2, 200) ll.print()