Code for Dummies

Friday, January 21, 2011

Delete linked list


int main() {
    NODE *p, *temp;
    while(p) {
        temp = p;
        p = p->next;
        free(temp);
    }
    return 0;
}

Posted by sowdri at 10:48 AM
Email This BlogThis! Share to X Share to Facebook

No comments :

Post a Comment

Newer Post Older Post Home
Subscribe to: Post Comments ( Atom )

Blog Archive

  • ►  2014 ( 2 )
    • ►  July ( 1 )
    • ►  January ( 1 )
  • ►  2013 ( 3 )
    • ►  December ( 1 )
    • ►  November ( 1 )
    • ►  October ( 1 )
  • ▼  2011 ( 17 )
    • ►  February ( 7 )
    • ▼  January ( 10 )
      • Find nth smallest element in binary search tree
      • Reverse linked list
      • Find loop in linked list
      • Delete linked list
      • Insert node in the middle of linked list
      • Find the character that repeats most in a string
      • Merge 2 sorted linked list
      • Check equality for linked list
      • Reverse linked list in groups of given size
      • Reverse a Linked List using recursion
Theme images by enot-poloskun. Powered by Blogger.