There are currently no frequently asked questions associated with this exercise – that’s where you come in! You can contribute to this section by offering your own questions, answers, or clarifications on this exercise. Ask or answer a question by clicking reply () below.
If you’ve had an “aha” moment about the concepts, formatting, syntax, or anything else with this exercise, consider sharing those insights! Teaching others and answering their questions is one of the best ways to learn and stay sharp.
Join the Discussion. Help a fellow learner on their journey.
Ask or answer a question about this exercise by clicking reply () below!
You can also find further discussion and get answers to your questions over in #get-help.
Agree with a comment or answer? Like () to up-vote the contribution!
The boilerplate answer requires use of an equality test of the “removed_head” with the “self.tail_node”.
This seems odd as the only ways the head and tail can be equal (i.e. the same object), is when there are either no Nodes in the Linked List, or if there is only one Node in the list - where both “head” and “tail” point to the same Node object. So if the “new_head” is None, the Linked List had only one Node in it, so both head and tail need to be None. So wouldn’t it be better to:
new_head = removed_head.get_next_node()
if new_head is not None:
new_head.set_prev_head(None)
else:
self.tail_node = None
self.head_node = new_head
This seems simpler and avoids introducing an equality check of data structures without more explanation of why this works. It happens to work with python class instances due to magic class methods defaulting to checking the memory refs of the objects, but in other languages a simple check like this may not work as expected without implementing a custom equality method over-ride or using a language specify identify equality method.
Hi! I don’t understand why we are not supposed to use “self.” before removed_node in the if statement like we previously used self.head_node in if statements