1. int length(Node *head) {
  2.     Node *curr = head;
  3.     int count = 0;
  4.  
  5.     while (curr != NULL) {
  6.         count++;
  7.         curr = curr->next;
  8.     }
  9.  
  10.     return count;
  11. }