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
If a node having two children is deleted from a binary tree, it is replaced by?? Inorder successor

explain collision resloving techniques in hasing

What are expression trees?  The leaves of an expression tree are operands, like as constants or variable names, and the other nodes have operators. This certain tree happens to

In the present scenario of global warming, the computer hard ware and software are also contributing for the increase in the temperature in the environment and contributing for the


explain two strategies to implement state charts with the help of an example of each.

Enumerate about the carrier set members Ruby is written in C, so carrier set members (which is, individual symbols) are implemented as fixed-size arrays of characters (which is

Conceptually, the stack abstract data type mimics the information kept into a pile on a desk. Informally, first we consider a material on a desk, where we might keep separate stack

What are the properties of an algorithsm?

It offers an effective way to organize data while there is a requirement to access individual records directly. To access a record directly (or random access) a relationship is