Linked List Data Structure Practice

1. Singly Linked List
2. Doubly Linked List
3. Circular Linked List
4. Circular Doubly Linked List

• C (Still Working On)
  • Singly Linked List
    • Insert Node At Front (Done).
    • Insert Nodet At End (Done).
    • Delete All Nodes (Done).
    • Delete Node At Location (Done).
    • Delete Specifc Node (Working On).
    • Print Node List (Done).
    • Reverse Node List (Working On).
    • Node List Length (Working On).
  • Circular Linked List
    • Insert Node At Front (Done).
    • Delete All Nodes (Done).
    • Print Node List (Done).
    • Node List Length (Done).
  • Doubly Linked List
    • Insert Node At Front (Done).
    • Node List Length (Done).
    • Print Node List (Done).
    • Reverse Node List (Working On).
  • Circular Doubly Linked List
    • Insert Node At Front (Done).
    • Print Node List (Done).
    • Delete All Nodes (Working On).
    • Node List Length (Done).
    • Reverse Node List (Working On).