@@ -11,19 +11,19 @@ class DoublyLinkedList[T]:
1111 """
1212
1313 def __init__ (self ):
14- self .__head : DoublyLinkedListNode [T ] = DoublyLinkedListNode [T ](None )
15- self .__tail : DoublyLinkedListNode [T ] = DoublyLinkedListNode [T ](None )
14+ self ._head : DoublyLinkedListNode [T ] = DoublyLinkedListNode [T ](None )
15+ self ._tail : DoublyLinkedListNode [T ] = DoublyLinkedListNode [T ](None )
1616
17- self .__head .next = self .__tail
18- self .__tail .previous = self .__head
17+ self ._head .next = self ._tail
18+ self ._tail .previous = self ._head
1919
2020 # O(N)
2121 def all_values (self ) -> list [T | None ]:
2222 """Return a list of every value in the list, in order from head to tail."""
2323 values = []
24- node = self .__head .next
24+ node = self ._head .next
2525
26- while node and node is not self .__tail :
26+ while node and node is not self ._tail :
2727 values .append (node .data )
2828 node = node .next
2929
@@ -34,22 +34,22 @@ def append(self, data: T):
3434 """Add a new node containing data to the end of the list, just before the sentinel tail."""
3535 # Last <-> Tail --> Last <-> New <-> Tail
3636 node = DoublyLinkedListNode (data )
37- last_node = self .__tail .previous
37+ last_node = self ._tail .previous
3838
3939 if last_node :
4040 last_node .next = node
4141 node .previous = last_node
4242
43- node .next = self .__tail
44- self .__tail .previous = node
43+ node .next = self ._tail
44+ self ._tail .previous = node
4545
4646 # O(N)
4747 def get_node (self , index : int ) -> DoublyLinkedListNode | None :
4848 """Return the node at index, or None if the index is out of bounds."""
49- current_node = self .__head .next
49+ current_node = self ._head .next
5050 count = 0
5151
52- while current_node and current_node is not self .__tail :
52+ while current_node and current_node is not self ._tail :
5353 if count == index :
5454 return current_node
5555 current_node = current_node .next
@@ -71,10 +71,10 @@ def insert(self, data: T, index: int):
7171 current_node : DoublyLinkedListNode [T ] | None = self .get_node (index )
7272
7373 if not current_node and index == 0 :
74- self .__head .next = node
75- node .previous = self .__head
76- node .next = self .__tail
77- self .__tail .previous = node
74+ self ._head .next = node
75+ node .previous = self ._head
76+ node .next = self ._tail
77+ self ._tail .previous = node
7878 return
7979
8080 if not current_node or not current_node .previous :
@@ -103,9 +103,9 @@ def remove(self, index: int) -> T | None:
103103 def size (self ) -> int :
104104 """Return the number of nodes in the list."""
105105 count = 0
106- node = self .__head .next
106+ node = self ._head .next
107107
108- while node and node != self .__tail :
108+ while node and node != self ._tail :
109109 count += 1
110110 node = node .next
111111 return count
0 commit comments