doubly linked list
RU: двусвязный список
A linked list whose nodes hold two pointers, one to the next node and one to the previous. This allows insertion and removal at both ends in O(1), which is why it can back a deque.
RU: двусвязный список
A linked list whose nodes hold two pointers, one to the next node and one to the previous. This allows insertion and removal at both ends in O(1), which is why it can back a deque.