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
Q1. Define the following terms: (i) Abstract data type. (ii) Column major ordering for arrays. (iii)  Row major ordering for arrays. Q2. Explain the following: (i) A

SPARSE MATRICES Matrices along with good number of zero entries are called sparse matrices. Refer the following matrices of Figure (a)

Overlapping or Intersecting A polygon overlaps or intersects the current background if any of its sides cuts the edges of the viewport as depicted at the top right corner of th

A tree is a non-empty set one component of which is designated the root of the tree while the remaining components are partitioned into non-empty groups each of which is a subtree

how to write a code for for a company , for calculate the salary pay

Q. Explain the insertion sort with a proper algorithm. What is the complication of insertion sort in the worst case?

According to this, key value is divided by any fitting number, generally a prime number, and the division of remainder is utilized as the address for the record. The choice of s

Two-dimensional array is shown in memory in following two ways:  1.  Row major representation: To achieve this linear representation, the first row of the array is stored in th

memory address of any element of lower left triangular sparse matrix

(a) Explain the term Group Support System and elaborate on how it can improve groupwork. (b) Briefly explain three advantages of simulation. (c) Explain with the help of a