int Length(Node L){ int len = 0; Node *p; p = L.next(); while(p != NULL) { len ++; p = p->next; } return len;}
