Manchester | 25-SDC-Nov | Rahwa Haile | Sprint 2 | Implement a linked list in Python

[RahwaZeslusHaile]

Manchester | 25-SDC-Nov | Rahwa Haile | Sprint 2 | Implement a linked list in Python

Learners, PR Template

Self checklist

• I have titled my PR with Region | Cohort | FirstName LastName | Sprint | Assignment Title
• My changes meet the requirements of the task
• I have tested my changes
• My changes follow the style guide

Implement a Doubly-Linked List in Python

Description

Implemented a complete doubly-linked list data structure with O(1) worst-case time complexity for all required operations.

Changes

• Created Node class with pointers to next and previous nodes
• Created LinkedList class with efficient head/tail management
• Implemented three core operations with guaranteed O(1) performance:
  • push_head(): Insert element at list head, returns handle for later removal
  • pop_tail(): Remove and return element from list end
  • remove(): Remove any element given its handle, without list traversal

Please review my work — thank you!