Interested to Buy Any Domain ? << Click Here >> for more details...
How can one find a cycle in the linked list? IF found how
to recognize the cycle and delete that cycle?
- 12 Answers
- 22602 Views
- Citrix, I also Faced
- E-Mail Answers
Answer Posted / monti
Ok guys now you all know the answer of "How to find if a
list has a cycle or not"...now answer this "Give an optimal
solution to return the stating point of cycle in a link-list
if it contains a cycle or else return NULL. You are given
head of that link-list"
| Is This Answer Correct ? | 4 Yes | 0 No |
Post New Answer View All Answers
Why it is said that searching a node in a binary search tree is efficient than that of a simple binary tree?
What is array traversing?
Explain the implementation of an AVL tree and Binary tree.
Why is hashmap faster than treemap?
What is selection sort with example?
Why do we need arrays if all the operations that are performed on arrays can be performed on arraylist?
Which language is best to learn data structures?
Can we give size to arraylist?
What things you would care about to improve the performance of application if its identified that its db communication that needs to be improved?
What are the advantages of data structure?
What is a linear search?
What is the difference between hashmap and linkedhashmap?
What does map stand for?
Which is better selection or bubble sort?
Is quicksort recursive?
