#include <iostream>
#include <vector>
using namespace std;
class Node{
    public:
    int data;
    Node* next;

    public:
    Node(int data1){
        data = data1;
        next = nullptr;
    }
};

Node* convertArrayToLL(vector<int> v){
    Node* head = new Node(v[0]);
    Node* mover = head;
    for(int i=1; i<v.size(); i++){
        Node* temp = new Node(v[i]);
        mover->next = temp;
        mover = temp;
    }
    return head;
}

int traverseAndLengthLL(Node* head){
    Node* temp = head;
    int length = 0;
    cout<<"LinkedList traversal:\n";
    while(temp){
        cout<<temp->data<<" | "<<temp->next<<"\n";
        length++;
        temp = temp->next;
    }
    return length;
}

int main() {
    vector<int> v={100,2,3};
    Node* head = convertArrayToLL(v);
    cout<<"Head of linkedList: "<<head->data<<"\n";
    int length = traverseAndLengthLL(head);
    cout<<"Length of LinkedList: "<<length<<"\n";
    return 0;
}