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
Q. Devise a representation for a given list where insertions and deletions can be made at both the ends. Such a structure is called Deque (which means Double ended queue). Write fu

B- Tree  A B-tree of order m is an m-way true in which  1)  All leaves are on the similar level 2)  All internal nodes except the root have at most m-1(non-empty) childre

What is Class invariants assertion A class invariant is an assertion which should be true of any class instance before and after calls of its exported operations. Generally

algorithm for multiplication of two sparse matrices using linked lists..

Multilist Representation of graph

How branching takes place in Instruction pipeline. Explain with suitable examples

since the gregorian calendar was introduced in 1752,a leap year occurs every 4 years.you are to write a pseudo code to find out whether a year is a leap year.your progrm should dis

The maximum degree of any vertex in a simple graph with n vertices is (n-1) is the maximum degree of the vertex in a simple graph.

Open addressing The easiest way to resolve a collision is to start with the hash address and do a sequential search by the table for an empty location.

one to many one to one many to many many to one