Chapter 5 linked list-double-ended linked list

Source: Internet
Author: User

The double-ended linked list is very similar to the traditional linked list. The only difference is that a last reference points to the end of the linked list. Therefore, you can add nodes at the end of the linked list. It takes O (1) to add nodes to the head and tail of the linked list ). If a node is deleted, the chain table header is O (1) and the end of the chain table is O (n ).

The reason for deleting the End Node of the linked list is O (n): Delete the N node, the next of the N-1 node needs to point to null, so you need to find the N-1 node, this operation takes O (n ). To solve this problem, two-way linked list will be introduced later in this chapter. Note the difference between "double"DirectionLinked List and doubleEndLinked List ".

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.