Related Blog Items

• Double Linked List With Out Using Special Head or Tail Node
• Circular Doubly Linked List With Out Using Special Head or Tail Node
• Reversing a double linked list
• Detecting a loop in single linked list
• Linked Lists

Here is a routine which does find out broken links in double linked list, wondering what is a broken link…

here is the code snippet for detecting broken links in double linked list…

for complete operations (all operations) on double linked list, visit earlier post

int detectbrokenlist(Node *n)
{
  int brokenlinks = 0;
  Node *tmp = n;
  Node* after = n->next;
  Node* before = n->prev;
 
  //detect abnormalities in the list (broken links) after n (if any)
  while(after && tmp)
  {
    if ((after->prev != tmp) || (tmp->next != after))
    {
      brokenlinks++;
    }
 
    after = after->next;
    tmp = tmp->next;
  }
 
  //detect abnormalities in the list (broken links) before n (if any)
  tmp = n;
  while(before && tmp)
  {
    if ((before->next != tmp) || (tmp->prev != before))
    {
      brokenlinks++;
    }
 
    before = before->prev;
    tmp = tmp->prev;
  }
 
  return brokenlinks;
}

any suggestions?

Popularity: 15%

You need to log on to convert this article into PDF

Related Blog Items

• Double Linked List With Out Using Special Head or Tail Node
• Circular Doubly Linked List With Out Using Special Head or Tail Node
• Reversing a double linked list
• Detecting a loop in single linked list
• Linked Lists

This entry was written by ponnada and posted on March 30, 2007 at 4:12 pm and filed under C Tidbits, Data Structures in C/C++. Bookmark the permalink. Follow any comments here with the RSS feed for this post. Post a comment or leave a trackback: Trackback URL.