State algorithm to insert node p at the end of a linked list, Data Structure & Algorithms

Assignment Help:

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.

Related Discussions:- State algorithm to insert node p at the end of a linked list

Define tree ?, A tree is a non-empty set one component of which is designat...

A tree is a non-empty set one component of which is designated the root of the tree while the remaining components are partitioned into non-empty groups each of which is a subtree

Drawback of sequential file, Following are some of the drawback of sequenti...

Following are some of the drawback of sequential file organisation: Updates are not simply accommodated. By definition, random access is impossible. All records should be

Dqueue, how can i delete from deque while deletion is restricted from one e...

how can i delete from deque while deletion is restricted from one end

Properties of asyptotic notations, what are the properties of asyptotic not...

what are the properties of asyptotic notations

Structure of an avl tree, Given is the structure of an AVL tree: struct ...

Given is the structure of an AVL tree: struct avl { struct node *left; int info; int bf; struct node *right; }; 2) A multiway tree of n order is an ord

State about the bit string, State about the Bit String Carrier set of...

State about the Bit String Carrier set of the Bit String ADT is the set of all finite sequences of bits, including empty strings of bits, which we denote λ. This set is {λ, 0

Examination, Write an algorithm for binary search. What are its limitations...

Write an algorithm for binary search. What are its limitations? .

Procedure to delete all terminal nodes of the tree, Q. Let a binary tree 'T...

Q. Let a binary tree 'T' be in memory. Write a procedure to delete all terminal nodes of the tree. A n s . fun ction to Delete Terminal Nodes from Binary Tree

Linked list, write an algorithm for multiplication of two sparse matrices u...

write an algorithm for multiplication of two sparse matrices using Linked Lists

Basic organization of computer system, what happen''s in my computer when ...

what happen''s in my computer when i input any passage

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages