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
Decision Tree - ID3 algorithm: Imagine you only ever do one of the following four things for any weekend:   go shopping   watch a movie   play tennis   just

Write an algorithm for searching a key from a sorted list using binary search technique 1.   if (low > high) 2.     return (-1) 3.    mid = (low +high)/2; 4    .if ( X

How can we convert a graph into a tree ? Do we have any standardized algorithm for doing this?

Write a program that uses the radix sort to sort 1000 random digits. Print the data before and after the sort. Each sort bucket should be a linked list. At the end of the sort, the

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.

There are three kinds of tree traversals, namely, Postorder , Preorder and Inorder. Preorder traversal: Each of nodes is visited before its children are visited; first the roo

You have to design a framework of a Genetic Algorithm (GA) with basic functionality. The basic functionality includes representation, recombination operators, tness function and se

Define data model?  A data model is a collection of conceptual tools for explaning data, data relationships, data semantics and consistency constraints.

Draw trace table and determine output from the following flowchart using following data: Number = 45, -2, 20.5

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