Each node is linked with its previous node using its previous pointer.Each node is linked with its next node using its next pointer.Each node carries a data and two pointer fields called next and prev. ![]() Doubly Linked List contains a pointer element called head. ![]()
0 Comments
Leave a Reply. |
Details
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |