![]() ![]() If we have tail pointer then inserting at the end takes only a constant time. The complexities given above are for the linked list that has only head pointer. The complexities of the operations discussed above are summarized in the table below.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |