Grounded header link list and a circular header link list, Data Structure & Algorithms

What is the difference between a grounded header link list and a circular header link list?

A header linked list is a linked list which always having a special node, known as the header node, at the starting of the list. The two kinds of header linked lists are:-

i. Grounder header linked list

ii. Circular header linked list

The difference among the two is that- A grounded header list is a header list where the last node having the null pointer.

A circular header list is a header list where the last node points back to the header node.  

 

Posted Date: 5/10/2013 2:56:20 AM | Location : United States







Related Discussions:- Grounded header link list and a circular header link list, Assignment Help, Ask Question on Grounded header link list and a circular header link list, Get Answer, Expert's Help, Grounded header link list and a circular header link list Discussions

Write discussion on Grounded header link list and a circular header link list
Your posts are moderated
Related Questions
i need the full concept of it... please can anyone provide

Here is a diagram showing similarities between documents; this is an actual set of physics lab assignments from a large university. Each node (square) in the graph is a doc

State in detail about the Integer Carrier set of the Integer ADT is the set {..., -2, -1, 0, 1, 2, ...}, and  operations on these values are addition, multiplication, subtrac

Design  and implement  an algorithm  to simulate car  re-organizing of the train at the railway switching junction. You can only use stacks as the data structure to represent the t

Q. Let X = (X1, X2, X3,....Xn) and Y= (Y1, Y2, Y3,....Xm) be the two linked lists respectively. Write down an algorithm to merge the lists together to get the linked list Z such th

Your first task will be to come up with an appropriate data structure for representing numbers of arbitrary potential length in base 215. You will have to deal with large negative

State the ways to construct container taxonomy There are several ways that we could construct our container taxonomy from here; one way that works well is to make a fundamental

Adjacency list representation An Adjacency list representation of Graph G = {V, E} contains an array of adjacency lists mentioned by adj of V list. For each of the vertex u?V,

Define min-heap A min-heap is a complete binary tree in which each element is less than or equal to its children. All the principal properties of heaps remain valid for min-hea

what do we use asymptotic notation in study of algorithm?Describe various asymptotic notation and give their significance.