What is the interconnected data structure?

Connected data structure is a collection of data organized in a format similar to the list. Each piece of data in the list is referred to as a node. Each node is connected to the next list on the list by link to the memory address of this subsequent node. Connected data structures are used most interconnected data. The structure is called a connected list. end.

The most interconnected DATES structures will use the smallest memory during the program. If a connected list is created with only one node and no other nodes are added, this list takes memory required only for one node. This is in sharp contrast to the data structure of the field in which the size of the entire field must be declared and assigned at the beginning of the program and cannot be changed.

lists lists are valid for their effective use of memory resources by requiring more computing power supply. Finding specific data inThe linked list requires a loop every time the whole list, so there may be slower access to information in the middle of the list.

Connected data structure may not have only one removal of another node; Can have several. Some lists have two links to nodes, one with the next node in the list and one with the previous node. They are known as double lists. This can accelerate movement through the list in both directions much faster, albeit at the expense of increased memory use for data structure.

It is possible that lists lists have three or more links to other nodes in the list. branch.