What are the basic types of link list in java?

Answer 1

linear

circular

double linked linear

double linked circular

Knowing the names does not help much when your teacher will require you to actually know what the names mean. Start reading. Programming requires lots of reading.

Answer 2

A linked list is a set of elements, usually structures, where each element contains a pointer or index to the "next" element, along with the data represented by the element.

Often, the elements are allocated from the heap. Sometimes, a fixed number of elements is contained in an array. In the first case, pointers are used. In the second case, indices are used.

Types of linked lists are ... In an array implementation, read pointer as index.

• Singly linked - there is a head pointer, and one next pointer per element. The last element's pointer is null. This type of list can be traversed in only one direction.
• Doubly linked - there is a head pointer, and each element contains two pointers, one to the previous element and one to the next element. This type of list can be traversed in two directions, making insertion and deletion a bit easier, at the cost of extra memory.
• Circularly linked - the same as Singly or Doubly linked, except that the last element's pointer points back to the first element's pointer. These types of lists are often used as queues.

Answer 3

4 types of linked lists are----

i> singly linear

ii> doubly linear

iii> multiply-linked lists

iv> singly circular

In singly linear linked list every node is divided into two fields---- data field and pointer field. Pointer field of each node contains only one pointer which points to the data field of the next node. Start pointer points to the first node and the pointer of the last node points to null. We can traverse in only one direction through it.

In doubly linear linked list every node is divided into three fields---- one data field and two pointer fields. One pointer points to the data field of its next node and another to its previous node. Start pointer points to the first node and the pointer of the last node points to null. We can traverse in both direction through it.

In multiply-linked list a single pointer field of a node can contain multiple pointers.Each field being used to connect the same set of data but in different order(by name or by date or by department).

In singly circular linked list every node is divided into two fields---- data field and pointer field. Pointer field of each node contains only one pointer which points to the data field of the next node. Start pointer points to the first node but unlike the singly linear linked list the pointer of the last node points to the first node. We can traverse in only one direction through it in circular way. Means we can go through the list in one direction and can get back to the first node in a circular way.

Answer 4

Singly Linked List

Doubly Linked List

Circular List