A doubly linked list is a data structure that consists set of sequentially linked records called nodes.Each node contains three fields two link fields one data field.The beginning and ending nodes previous and next links,respectively, point to some kind of terminator,typically a sentirely node or null,to facilitate traversal of the list.if there is only one sentinel node,then the list is circularly linked via the sentinel node .
