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

Your posts are moderated
Related Questions
The two famous methods for traversing are:- a) Depth first traversal b) Breadth first

I need a recursive algorithm to implement the FIRST function to any grammar

Linear search employee an exhaustive method of verified each element in the array against a key value. Whereas a match is found, the search halts. Will sorting the array before uti

Which data structure is required to change infix notation to postfix notation?    Stack function is used to change infix notation to postfix notatio n

How many nodes in a tree have no ancestors 1 node in atree have no ancestors.

#why all the 4 operations i.e. insertion n deletion from rear end and front end is valid in input restricted DEQUE

How does operations like insertion, deletion occur?

In this part, students are allowed to implement the following simplifications in their table and data design. o Availability for the beauty therapists don't have to be considere

how to write a pseudo code using Kramer''s rule

Q. What do you understand by the term Binary Tree? What is the maximum number of nodes which are possible in a Binary Tree of depth d. Explain the terms given below with respect to