Double-Ended Linked List
List structures have both a head and a tail,
so nodes may be appended to the list,
and the first and last nodes may be removed.
List structures have both a head and a tail,
so nodes may be appended to the list,
and the first and last nodes may be removed.
"Nodes have both forward and backward pointers, so both traversals are natural, and nodes may be inserted or removed before or after any node.It would be easy to add circular variants as well[Wiki]".
References:
No comments:
Post a Comment