Algorithm 5 Singly Circular Linked List

Ensure: Implementation of dictionary operations with singly circular linked list

1:procedure Insert( $L, x$ )

2: $x.next = L.nil.next$

3: $L.nil.next = L$

4:end procedure

6:procedure Delete( $L, x$ )

7: $p = L.nil$

8:while $p.next \ne x$ do

9:if $p.next == L.nil$ then

10:error " $x$ doesn't exist in $L$ "

11:end if

12: $p = p.next$

13:end while

14: $p.next = x.next$

15:end procedure

16:

17:procedure Search( $L, k$ )

18: $x = L.nil.next$

19:while $x \ne L.nil$ and $x.key \ne k$ do

20: $x = x.next$

21:end while

22:return $x$

23:end procedure