Data Structure - Traversing a linked list

-

Traversing is nothing but, accessing each record exactly once.
In simple manner we can say that traversing is nothing but visiting or accessing each record of data structure.

ALGORITHM FOR TRAVERSING A LINKED LIST

As we can see in above algorithm the traversing of linked list is properly described in easy manner.
In the first step of algorithm we have set pointer to the start location.
Here we have to use while loop, which will goes continue till null pointer reached.
Now we have to access each and every element/node of linked list named INFO to increase the counter we are putting link of next element into the ptr.
So that the loop will go to next position.
In this way each & every element of linked list will be accessed & final step is Exit.

Comments

Post a Comment

Popular posts from this blog

Theory part introduction

-
  Computer :-            संगणक हे एक इलेक्ट्रॉनिक उपकरण आहे जे कीबोर्ड आणि माऊस च्या माध्यमातून महिती स्वीकारतो आणी त्या माहितीला memory मध्ये साठून ठेवते या माहितीवर प्रक्रिया करून आपल्याला अचुक उत्तर देते. -> Accept/Input data -> Store it -> Process it -> Output          तसेच हा संगणक बेरिज, वजाबाकी, गुणाकार आणि भागाकार व तर्ककि प्रक्रिया हे कार्य पार पडते. Input Device-                     हे device मानवाला समजणारी भाषा स्वीकारत असतात आणि संगणकीय भाषेत रूपांतरीत करत असतात अशा उपकरणाला input device ase म्हणतात. Ex., Keyboard, Mouse, Scanner, joystick. Output device -                     संगणकीय भाषेचे रूपांतर मानवाला समजणाऱ्या भाषेमध्ये करण्याचे कार्य Output device करत असतात. Ex., Printer, monitor, speaker, headphone. Memory -           आपण दिलेल्या सूचना किंवा आज्ञा साठऊन ठेव...
Read more

Data structure - Sorting methodes

-
Image
  Sorting methods 1)     Bubble sort – Sorting is a technique to rearrange in data structure. Here in bubble sort adjacent element if first element is greater than next element then swapping occurs. In the same way between inner loop and outer loop goes continuously and all the elements gets compared and swapped for all the arrangement.   Algorithm for bubble sort   1.        Repeat for i=1 to n. 2.        Repeat for j=1 to n. 3.        If LA[j]>LA[j+1], Then:swap. [end of if] [end of step 2 loop] [end of step 1 loop] 4.        Exit .     2)     Selection sort – As per its name in this sorting method the elements are compared with all other position that’s why the smallest element will be automatically comes to 1 st position. In the same way loops goes continuously from first p...
Read more