Adv. Algorithms & Data Structures Nodes Adding a node (part I)

Adv. Algorithms & Data Structures

Adding a node (part I)

Imagine that we have a class called Node with two attributes: value and next. Each node can have a value (e.g. a number such as 5 or 17) and where next points can point to another node.

Given the following class, write your code so that you are creating two nodes: one called node1 and another called node2. Set it up so that node1's value is set as 5 and node2's value 7. Then have node1's next point to node2.

Before proceeding, please watch the following videos.

OOP in 10 minutes

Javascript OOP and ES6 syntaxdes

(0/3) Solved

class Node {
    constructor(value) {
        this.value = value;
        this.next = null;
    }
}

1
2
3
// Enter code below
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

Test Cases (0/4)

node1.value to equal 5
node2.value to equal 7
node1.next.value to equal 7
node1.next.next to equal null

Output

Michael

Test Cases (0/4)

Output

Run Your Code

Run Your Code

Community Tab