Python: Doubly Linked Lists

Doubly linked lists implemented in Python. Bidirectional linked-lists demo example.

PYTHON LINKED LISTS

[francis]

thanks a lot Joe, clear graphs and codes really helpful for understanding

[agmaeso]

Thnx Joe. Could you check in the remove method, if the else clause (prev is None) is correct?. I think that self.root must be made equal to next because this_node is being removed.

[smilefaxxe]

This is helpful, thank you for sharing!

[piotrmodlinger]

In line 56 shuldn't be self.root = this_node.get_next() ? Without this step the single element will not be removed.

[agroforestryconsultancyroz]

What's the difference of this and an index enumerated list and get prev and next by list[index -1 and +1] during the iteration ?

[alexanderrosenbergjohansen]

Shouldn't root be next in remove?

[Matt-prye]

There is a problem, doubly linked list should remove any node in O(1). I think the remove method's parameters should be a node, not a data.

[HP-vyis]

Thanks Joe, Excellent clean efficient code

[DCentFN]

Hi Joe, just wondering if it was at all possible to store data on the edges between each node? I'm looking to store an integer.

[MarlyssonSilva]

I'm first example from linked list ( image ) .
, the root don't was to be the data from first node?

Because when get the root ( using your example ) would return None, and define the root to first node returning the data attribute.

[raduandreicosmin]

Hi! I was wondering what the purpose of the "else: self.root = this_node " near the end of the remove function is

[elzbietakrzeczek]

Hi, I want to ask you if you know how to print the bidrectional list from the end to beginning?

[dmitri]

how many and what use cases would fit going down this low level?

[gouthampratapa]

can you please add print function as well it wuld be great if you add that as well

[parthpandya]

how to do it without Object oriented programming