Algorithm to add element in the end of circular linked list, Data Structure & Algorithms

Assignment Help:

Q. Write down an algorithm to add an element in the end of the circular linked list.

Ans.

Algorithm to Add the Element at the End of Circular Linked Lists written below.

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 element in the end of circular linked list

Implement stack using two queues, How To implement stack using two queues ,...

How To implement stack using two queues , analyze the running time of the stack operations ?

Define abstract data type & column major ordering for arrays, Q1. Define th...

Q1. Define the following terms: (i) Abstract data type. (ii) Column major ordering for arrays. (iii) Row major ordering for arrays. Q2. Explain the following: (i) A

Non-recursive implementation of preorder traversal, For preorder traversal,...

For preorder traversal, in the worst case, the stack will rise to size n/2, where n refer to number of nodes in the tree. Another method of traversing binary tree non-recursively t

Implement a min-heap, Description A heap is an efficient tree-based data...

Description A heap is an efficient tree-based data structure that can be used as a priority queue. Recall that the abstract data type of a priority queue has the following opera

Determine the area subdivision method, Area Subdivision Method In this ...

Area Subdivision Method In this method, the viewport is examined for clear decisions on the polygons situated in it, in regard to their overlap and visibility to the viewer. Fo

Infix to postfix conversion, A(B+D)/E-F(G+H/K)

A*(B+D)/E-F*(G+H/K)

Big o notation, This notation gives an upper bound for a function to within...

This notation gives an upper bound for a function to within a constant factor. Given Figure illustrates the plot of f(n) = O(g(n)) depend on big O notation. We write f(n) = O(g(n))

Example of telephone directory, A telephone directory having n = 10 records...

A telephone directory having n = 10 records and Name field as key. Let us assume that the names are stored in array 'm' i.e. m(0) to m(9) and the search has to be made for name "X"

Structures for complete undirected graphs, Q. Draw the structures of compl...

Q. Draw the structures of complete undirected graphs on one, two, three, four and five vertices also prove that the number of edges in an n vertex complete graph is n(n-1

Illustrate the wire frame representation, RENDERING, SHADING AND COLOURING ...

RENDERING, SHADING AND COLOURING By introducing hidden line removal we have already taken one step away from wire-frame drawings towards being able to realistically model and d

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages