Tell me about circular linked list?
- 1 Answers
- 1015 Views
- I also Faced
- E-Mail Answers
Answer / Anu Sirohi
A Circular Linked List is a type of linked list where the last node's next pointer points back to the first node, creating a cycle. This allows traversing the list indefinitely from any starting point. The advantage of a circular linked list over a regular (non-circular) linked list is that you can traverse through it without having to check for the end of the list explicitly. However, this can also make certain operations like finding the length or determining whether an element exists more complex.
| Is This Answer Correct ? | 0 Yes | 0 No |
Is it possible to insert different type of elements in a stack? How?
difference between the run time polymorphism and compile time poly morphism and about virtual function.
2 Answers CybAge, Innowe, TCS, Wipro,
What is the difference between data types and data structures?
Is selection sort greedy?
How to excel in data structures and algorithms?
How many different binary trees and binary search trees can be made from three nodes that contain the key values 1, 2 & 3?
28 Answers Accenture, Amazon, College School Exams Tests, iGate, Microsoft, TCS, Wipro,
What do you mean by hash table?
Define secondary clustering?
What is the best case complexity of quicksort?
Can arraylist store objects?
What is the difference between array and stack?
What are examples of data structures?
Windows 
