Algorithm to Insert a Node p at the End of a Linked List is explained below

Step1:   [check for space]

If new1= NULL output "OVERFLOW"

And exit

Step2:   [Allocate free space] New1 = create new node.

Step3:   [Read value of information part of a new

node]

Info[new1]=value

Step4:   [Move the pointer to the end of the list]

node = previous=strt

Repeat while Node != NULL Previous=node

Node = Next[Node]

Step5:   [Link currently created node with the last node of the list]

Next[New1] = Node

Next[Previous] = New1

Step6:   Exit.

Posted Date: 7/13/2012 2:08:33 AM | Location : United States

Ask an Expert

Related Discussions:- State algorithm to insert node p at the end of a linked list, Assignment Help, Ask Question on State algorithm to insert node p at the end of a linked list, Get Answer, Expert's Help, State algorithm to insert node p at the end of a linked list Discussions

Write discussion on State algorithm to insert node p at the end of a linked list
Your posts are moderated

Write your message here..

Related Questions

Advantages of the last in first out method, Materials consumed are priced i... Materials consumed are priced in a systematic and realistic manner. It is argued that current acquisition costs are incurred for the purpose of meeting current production and sales

HUFFMAN CODING, Ask question 1. Indicate whether each of the following prop... Ask question 1. Indicate whether each of the following properties is true for every Huffman code. a. The codewords of the two least frequent symbols have the same length. b. The

Demonstrate that dijkstra''s algorithm, Demonstrate that Dijkstra's algorit... Demonstrate that Dijkstra's algorithm does not necessarily work if some of the costs are negative by finding a digraph with negative costs (but no negative cost dicircuits) for whi

The best average behaviour, The best average behaviour is shown by  Qui... The best average behaviour is shown by  Quick Sort

Illustrate the back face detection method, Illustrate the Back Face Detecti... Illustrate the Back Face Detection Method A single polyhedron is a convex solid, which has no external angle between faces less  than 180° and there is a simple object space me

Tower of hanoi, how do we use 4-discs stack to solve tower of hanoi problem... how do we use 4-discs stack to solve tower of hanoi problem and write an algorithm to solve it?

Physical database design and sql queries, In this part, students are allowe... In this part, students are allowed to implement the following simplifications in their table and data design. o Availability for the beauty therapists don't have to be considere

Frequency count, what is frequency count what is frequency count

Multidimensional array, Q. The system allocates the memory for any of the m... Q. The system allocates the memory for any of the multidimensional array from a big single dimensional array. Describe two mapping schemes that help us to store the two dimensi

Develop a material requirements plan, The below figure illustrates the BOM ... The below figure illustrates the BOM (Bill of Materials) for product A. The MPS (Material requirements Planning) start row in the master production schedule for product A calls for