title: Implement dictionary using singly linked circular list
body: <p>I was solving a problem in which i have to implement the dictionary operation insert,delete and search using singly linked, circular list. What are the running times of your procedures ?
  <br>
  1) Insert : It can be done in O(1) <br>
  2) Deletion : It can be done in O(1) <br>
  3) Search : I'm not sure of it . O(length_of_linked_list) is the worst case of it .<br></p>
  
  <p>Can Search  be done in even fast running time ??</p>