class Slist {
        constructor() {
            this.head = null;
        }
    
        add_to_back(value) {
    // Enter code below
    הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
    XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
        }
    }
    
    class Node {
        constructor(value) {
            this.value = value;
            this.next = null;
        	}
    }
    
    list = new Slist();
    list.add_to_back(3);
    list.add_to_back(5);
    list.add_to_back(7);
    Test Cases (0/3)
    • list.head.value to return 3

    • list.head.next.value to return 5

    • list.head.next.next.value to return 7

    Output
    Michael