2 ms·
You’ve never needed a doubly linked list, tree that could be traversed in either direction or a graph?
by jonhohle 4y ago
You’ve never needed a doubly linked list, tree that could be traversed in either direction or a graph?
- vore 4y agoYou can generally make do with weak references. For a doubly-linked list, you can make the backwards pointer weak.