Sign Up

Have an account?

Sign In

Don't have account,

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account?

You must login to ask question.

Need An Account,
Search
Ask A Question
Home/ Engineering Questions/data structure
On: Posted in Engineering Questions Comments: 3 Views: 65

data structure

explain double linkedlist?

Previous article
Next article

3 Comments

  1. suresh

    suresh

    View Profile
    suresh
    2012-11-12T08:32:53+05:30Added a comment on November 12, 2012 at 8:32 am

    we can remove nodes at any point…
    insert at any point

  2. suresh

    suresh

    View Profile
    suresh
    2012-11-12T08:33:20+05:30Added a comment on November 12, 2012 at 8:33 am

    insert at any point;;

  3. Anonymous
    2012-12-25T05:26:20+05:30Added a comment on December 25, 2012 at 5:26 am

    In computer science, a doublelinked list is a linked data structure that consists of a set of sequentially linked records called nodes. Each node contains two fields, called links, that are references to the previous and to the next node in the sequence of nodes. The beginning and ending nodes’ previous and next links, respectively, point to some kind of terminator, null, to facilitate traversal of the list

Leave a comment