Sheffield | 25-SDC-Nov | Hassan Osman | Sprint 2 | Implement a linked list in Python#124

Closed

HassanOHOsman wants to merge 22 commits intoCodeYourFuture:mainfrom

HassanOHOsman:implement/linked-list-in-Python

Commits on Feb 26, 2026

create a Node class that stores the value of the data it contains and references to both previous and next nodes
HassanOHOsman
committed
Create anthor class that models the linked list
HassanOHOsman
committed
define a function that push a new node to the beginning of the linked list + create a node object to represents that node that will become the new head
HassanOHOsman
committed
check if the linked list have nodes, if so, appoints the new object to become head of the linked list.
HassanOHOsman
committed
update the "former" head node's prev pointer to point to the new head ndoe
HassanOHOsman
committed
make the new created node as the head node incase that the linked list is empty
HassanOHOsman
committed
update logic so that it check if the linked list is empty if so to the new created ndoes becomes the tail node too
HassanOHOsman
committed
create pop_tail function that checks if the linked list has nodes in it, if so, disconnect the tail so it gets removed.
HassanOHOsman
committed
when linekd array has nodes, udpate pointers to get rid of the tail.
HassanOHOsman
committed
move the pointer to tail node to point the the previous node
HassanOHOsman
committed
after repositioning pointer of last node towards the seond to last node., disconnect from the node that comes after it (initial tail node)
HassanOHOsman
committed
add if condition so that logic handles when linked list has more than one node in it.
HassanOHOsman
committed
update logic to handle when linked list is empty: Throw an error
HassanOHOsman
committed
add a return to pop_tail to pass tests
HassanOHOsman
committed
update pop_tail function to handle when there's one node in the linked list
HassanOHOsman
committed
since test require "previous", replacing all mentions to "prev" with "previous" so that tests pass
HassanOHOsman
committed
build remove function - make it check if there's a node before our current node - if so reposition pointer so it's disconnected from the linked list
HassanOHOsman
committed
update logic inside remove function so that when the current node is the head, the next node becomes the new head and thus current node disconnected and removed from linked list.
HassanOHOsman
committed
updat remove function to handle when node points to other next node in the linked list - if so reposition pointers so curent node is removed. else if the current node is the tail make the previous …
HassanOHOsman
committed
ignore VM for Sprint 2
HassanOHOsman
committed
create a branch so that pull request can be pushed
HassanOHOsman
committed

Commits on Feb 27, 2026

update read me to explain a new branch created for this task so a pull request to can pushed
HassanOHOsman
committed

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Sheffield | 25-SDC-Nov | Hassan Osman | Sprint 2 | Implement a linked list in Python#124

Sheffield | 25-SDC-Nov | Hassan Osman | Sprint 2 | Implement a linked list in Python#124
HassanOHOsman wants to merge 22 commits intoCodeYourFuture:mainfrom
HassanOHOsman:implement/linked-list-in-Python

Commits on Feb 26, 2026

create a Node class that stores the value of the data it contains and references to both previous and next nodes

Create anthor class that models the linked list

define a function that push a new node to the beginning of the linked list + create a node object to represents that node that will become the new head

check if the linked list have nodes, if so, appoints the new object to become head of the linked list.

update the "former" head node's prev pointer to point to the new head ndoe

make the new created node as the head node incase that the linked list is empty

update logic so that it check if the linked list is empty if so to the new created ndoes becomes the tail node too

create pop_tail function that checks if the linked list has nodes in it, if so, disconnect the tail so it gets removed.

when linekd array has nodes, udpate pointers to get rid of the tail.

move the pointer to tail node to point the the previous node

after repositioning pointer of last node towards the seond to last node., disconnect from the node that comes after it (initial tail node)

add if condition so that logic handles when linked list has more than one node in it.

update logic to handle when linked list is empty: Throw an error

add a return to pop_tail to pass tests

update pop_tail function to handle when there's one node in the linked list

since test require "previous", replacing all mentions to "prev" with "previous" so that tests pass

build remove function - make it check if there's a node before our current node - if so reposition pointer so it's disconnected from the linked list

update logic inside remove function so that when the current node is the head, the next node becomes the new head and thus current node disconnected and removed from linked list.

updat remove function to handle when node points to other next node in the linked list - if so reposition pointers so curent node is removed. else if the current node is the tail make the previous …

ignore VM for Sprint 2

create a branch so that pull request can be pushed

Commits on Feb 27, 2026

update read me to explain a new branch created for this task so a pull request to can pushed