If the address part of the node contains the header address then cycle is

How can one find a cycle in the linked list? IF found how
to recognize the cycle and delete that cycle?

Question Posted / kannan

Answer Posted / kannan

If the address part of the node contains the header address
then cycle is formed Is it so...

Is This Answer Correct ?

21 Yes

16 No

Please Help Members By Posting Answers For Below Questions

Can we put null key in hashmap?

903

How do you represent a linked list?

905

What is a data structure? What are the types of data structures? Briefly explain them

965

What is binary tree? Explain its uses.

895

What you mean by sorting?

925

We know that Arrays are objects so why cannot we write strArray.length()?

1610

What do you mean by general trees?

1016

What are the operations that can be performed on a stack?

915

Which is the simplest file structure? (a) Sequential (b) Indexed (c) Random (a) Sequential

1122

What are the advantages and disadvantages of linked list over array?

1044

Write a program to reverse a link list.

936

What is top in stack?

854

What are the Differences between map and hashmap?

1009

Explain implementation of deletion from a binary tree.

962

How to use appendNode() in linkedlist()?

1091