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

Ask an Expert

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

Write your message here..

Related Questions

Best case, Best Case: If the list is sorted already then A[i] T (n) = ... Best Case: If the list is sorted already then A[i] T (n) = c1n + c2 (n -1) + c3(n -1) + c4 (n -1)  = O (n), which indicates that the time complexity is linear. Worst Case:

Data type, Q. Define the terms data type and abstract data type. Comment up... Q. Define the terms data type and abstract data type. Comment upon the significance of both these.   Ans: We determine the total amount of memory to reserve by determining

Two-dimensional array, Two-dimensional array is shown in memory in followin... 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

Calculation of time complexity, Example: Assume the following of code: ... Example: Assume the following of code: x = 4y + 3 z = z + 1 p = 1 As we have been seen, x, y, z and p are all scalar variables & the running time is constant irrespective

Adjacency list representation, Adjacency list representation An Adjacen... Adjacency list representation An Adjacency list representation of Graph G = {V, E} contains an array of adjacency lists mentioned by adj of V list. For each of the vertex u?V,

Time required to delete a node x from a doubly linked list, The time needed... The time needed to delete a node x from a doubly linked list having n nodes is O (1)

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

How to write binary search algorithm?, Q. Write down the binary search algo... Q. Write down the binary search algorithm and trace to search element 91 in following given list: 13          30          62           73         81         88             91

Importance of object-oriented over java, Importance of Object-Oriented over... Importance of Object-Oriented over java Java is basically based on OOP notions of classes and objects. Java uses a formal OOP type system that should be obeyed at compile-t

Chaining Method as Method of Collision Resolution , Q. The given values are... Q. The given values are to be stored in a hash table 25, 42, 96, 101, 102, 162, 197 Explain how the values are hashed by using division technique of hashing with a table