Algorithm to add an element at the end of linked list, Data Structure & Algorithms

Assignment Help:

Write an algorithm to add an element at the end of circular linked list.

Algorithm to Add the Element at the End of Circular Linked List.

IINSENDCLL( INFO, LINK, START, AVAIL, ITEM)

The algorithm deletes last element from the circular linked list.

1. [OVERFLOW?] if AVAIL = NULL, then Write:

OVERFLOW, and Exit.

2. [Remove first node from the AVAIL: = LIN[AVAIL].

a. Set NEW:= AVAIL and AVAIL:=LINK[AVAIL].

3. Set INFO[NEW]:=ITEM. [copies new data into new node.]

4. Set PTR:= LINK[START] and

SAVE:=START.[initializes popinters]

5. Repeat while LINK[PTR]!=START: [ Traverses list seeking last node.]

a. Set PTR:=LINK[PTR]. [Updates PTR]

[ End of loop]

6. Set LINK [PTR]:= NEW. [ Attaches new node to the last node of the list]

7. Set LINK[NEW]:= START [ New node now points to the original first node.]

8. Exit

Related Discussions:- Algorithm to add an element at the end of linked list

Variable length codes, Variable length codes (Niveau I) Code the following ...

Variable length codes (Niveau I) Code the following sequence of integers (2, 4, 2, 8, 3, 1, 4, 5, 13, 2) with • unary codes • ? codes • d codes • Rice codes (for a suitable l) and

Linked list implementation of a queue, The fundamental element of linked li...

The fundamental element of linked list is a "record" structure of at least two fields. The object which holds the data & refers to the next element into the list is called a node .

Pseudocode algorithm to print the numbers from 1 to 10, 1. Write a pseudoco...

1. Write a pseudocode algorithm to print the numbers from 1 to 10, and then from 10 to 1, using exactly one loop. 2. The function contains() takes a food as an argument and tell

The theta-notation, This notation bounds a function to in constant factors....

This notation bounds a function to in constant factors. We say f(n) = Θ(g(n)) if there presents positive constants n 0 , c 1 and c 2 such that to the right of n 0 the value of f

Efficient algorithms.., implementation of fast fourier transforms for non p...

implementation of fast fourier transforms for non power of 2

Queue, algorithm for insertion in a queue using pointers

algorithm for insertion in a queue using pointers

Tree, tree is graph or not

tree is graph or not

#recursion, #2 example of recursion

#2 example of recursion

Objectives of lists, After going through this unit, you will be able to: ...

After going through this unit, you will be able to: • define and declare Lists; • understand the terminology of Singly linked lists; • understand the terminology of Doubly

Size of stack, The size of stack was declared as ten. Thus, stack cannot ho...

The size of stack was declared as ten. Thus, stack cannot hold more than ten elements. The major operations which can be performed onto a stack are push and pop. However, in a prog

5/11/2013 12:53:03 AM Thanks for suggesting me this answer, appreciate your knowledge.

5/11/2013 12:53:03 AM

Thanks for suggesting me this answer, appreciate your knowledge.

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages