Follow

Translate

Wednesday, March 16, 2016

What is Linked Lists?

 Linked Lists:  A linked list, or one-way list, is a linear collection of data elements, called  nodes, where the linear order is given by means of pointers.The node is divided in the two parts; The first part is contains the information of the elemnts and The second part is the link field or nextpointer field, contains the address of the next node in the list.


A linked list with 6 nodes.The left part represents the information part of the node, which may contain an entire record of data items. The right parts represents the next pointer field of the node.

The pointer of the last node contains a special value, called the null pointer , which is any invalid address..

The null pointer, denoted by x in the diagram, signals the end of the list.The linked list also contains a list pointer cariable-called START or NAME-which contains the address of the first node in the list;
If You want to learn about the technology, computer science & engineering, web programming, freelancing, earning please click here :CSE SOLVE

Related Posts:

  • Algorithm Largest Element in Array Algorithm 2.1: (Largest Element in Array) A nonempty array DATA with N numerical values is given.This algorithm finds the location LOC and the value MAX of the largest element of DATA.The variable K is used as a counter. St… Read More
  • Queue What is Queue? Queue: A queue, also called a first-in first-out(FIFO) system, is a linear list in which deletions can take place only at one end of the list, the "front" of the list, and insertions can take place only at th… Read More
  • Linear Search Algorithm 2.4 Linear Search Algorithm 2.4: (Linear Search) A Linear Array DATA with N elements and a specific ITEM of information are given. This algorithm finds the location LOC of ITEM in the array DATA or sets LOC = 0. 1.  [Ini… Read More
  • Data Structure Operations The following four operations play a major role in this text: 1.Traversing: Accessing each record exactly once so that certain items in the record may be processed. 2.Searching: Finding the location of the record with… Read More
  • Complexity Of Algorithms Complexity Of Algorithms: There are two case for describing in the complexity of algorithms: (1) Worst Case: The Maximum value of f(n) for any possible input. (2) Average Case: The expected value of f(n) Sometimes we al… Read More

0 comments:

Post a Comment