A linked list can be of the following types:-

 Linear linked list or one way list

Doubly linked list or two way list.

Circular linked list

Header linked list 

Posted Date: 5/10/2013 6:15:33 AM | Location : United States

Ask an Expert

Related Discussions:- Types of a linked list, Assignment Help, Ask Question on Types of a linked list, Get Answer, Expert's Help, Types of a linked list Discussions

Write discussion on Types of a linked list
Your posts are moderated

Write your message here..

Related Questions

Write a procedure that produces independent stack, Write a procedure (make-... Write a procedure (make-stack) that produces independent stack objects, using a message-passing style, e.g. (define stack1 (make-stack))  (define stack2 (make-stack)) W

Mapping constain, one to many one to one many to many many to one one to many one to one many to many many to one

Complexity of quick sort, Q. What do you mean by the best case complexity o... Q. What do you mean by the best case complexity of quick sort and outline why it is so. How would its worst case behaviour arise?

Sorting, how to do a merge sorting how to do a merge sorting

Multiqueue, data structure for multiqueue data structure for multiqueue

The data structure required to evaluate a postfix expression, The data stru... The data structure needed to evaluate a postfix expression is  Stack

Example of single node with multiple elements, The class Element represents... The class Element represents a single node that can be part of multiple elements on a hotplate and runs in its own thread. The constructor accepts the initial temperature and a hea

Infix to postfix, [(a+b)/(c+d)^(e+f)]+(g+h)/i [(a+b)/(c+d)^(e+f)]+(g+h)/i

linear-expected-time algorithm, Implement a linear-expected-time algorithm... Implement a linear-expected-time algorithm for selecting the k th smallest element Algorithm description 1. If |S| = 1, then k = 1 and return the element in S as the an

Implementation of queue by using a single linked list, Q. Perform implement... Q. Perform implementation of a queue using a singly linked list L. The operations INSER and DELETE should take O (1) time.