0
Heterogeneous Linked List is a linked list data-structure that contains or is capable of storing data for different datatypes.
void pointer is basically used in these types of linked list as we are not sure of which type of data needs to be stored
Wiki User
∙ 13y ago
A heterogeneous linked list is a data structure where each node can store data of different types. This allows for a flexible way to organize and manipulate data that may vary in structure or content. Each node contains a pointer to the next node in the list, enabling traversal and manipulation of the data.
Add your answer:
Earn +20 pts
What is hetrogenious linked list?
A heterogeneous linked list is a linked list where each node can store different types of data. This is different from a homogeneous linked list where all nodes store the same type of data. Heterogeneous linked lists can be useful for scenarios where you need to store multiple types of data in a single list.
What is the difference between doubly linked list and circular linked list?
A doubly linked list allows traversal in both directions (forward and backward) by having each node point to both its next and previous nodes. A circular linked list is a type of linked list where the last node points back to the first node, forming a circular structure. This allows continuous traversal through the elements without a definitive end.
what are the various operations in linked list which can be performed on linked list?
Some common operations that can be performed on a linked list include inserting a node, deleting a node, searching for a specific node, traversing the list, and updating a node's value. Other operations may include reversing the list, merging two lists, sorting the list, and finding the length of the list.
How do you implement a doubly linked list by using singly linked list?
To implement a doubly linked list using a singly linked list, you can create two nodes in each element of the singly linked list - one for the next element and another for the previous element. This way, each node will have access to both its previous and next nodes, effectively creating a doubly linked list structure using a singly linked list implementation.
What is the advantage of doubly linked list over singly linked list?
It's not that one is better than the other. They are used in different circumstances. A linear linked list is used like an array, with the added benefits of random insertion/removal of elements, etc. A circular linked list is often used as a buffer where one portion of the program produces data and another consumes it, such as in communications.
What is hetrogenious linked list?
A heterogeneous linked list is a linked list where each node can store different types of data. This is different from a homogeneous linked list where all nodes store the same type of data. Heterogeneous linked lists can be useful for scenarios where you need to store multiple types of data in a single list.
What pointer type will you use to implement a heterogeneous linked list in c?
void pointer
How linked list store heterogeneous type of data?
i dont know if anyone know it please do answer me quickly.!!
Convert single linked list to double linked list?
You copy a singly linked list into a doubly linked list by iterating over the singly linked list and, for each element, calling the doubly linked list insert function.
Which is the easy insertion operator single linked-list or double-linked list?
It is easier to insert into a singly linked list.
What is the difference between linked list and Ordinary list?
A list is an abstract data structure, usually defined as an ordered collection of data. A linked list refers to a specific implementation of a list in which each element in the list is connected (linked) to the next element.
What is non-integer linked list?
Linked list of strings, for example.
What is the difference between doubly linked list and circular linked list?
A doubly linked list allows traversal in both directions (forward and backward) by having each node point to both its next and previous nodes. A circular linked list is a type of linked list where the last node points back to the first node, forming a circular structure. This allows continuous traversal through the elements without a definitive end.
What is difference between linked list and singly linked list?
Answersingly linked list has the node inserted only at one end. and the pointer corresponds to the next pointer.but in a doubly linked list, the node pointer points to the both previous and the next node.singly linked list has two nodesdoubly linked list has three nodesA doubly linked list makes sense when you need to traverse the list in both directions. You aren't able to do that with a singly linked list.
Where linked list using?
linked list are used for creation of stack,queues to use memory in optimum manner linked list are used as they are dynamic in nature
Which of the following data structures can be randomly accessed giving loc A. linked list implemented using array B. singly linked list C. double linked list D. both single and double linked list?
Which of the following data structures can be randomly accessed giving loc?A. linked list implemented using arrayB. singly linked listC. double linked listD. both single and double linked listThe answer is A.
How the pointer used in the linked list?
The pointer in linked list is used for traversing through the elements of the linked list. In a singly linked list, only a next pointer exits. So this pointer can be used for traversing only in one direction in the list. In case of a doubly linked list, a next and previous pointer exits. These pointers are used for traversing in both direction in the list.
