Question

1. Given the two linked lists L1 and L2 below, answer the related questions below. L1 = {5, 9, 1, 3} L1 \(\rightarrow\) 5 \(\rightarrow\) 9 \(\rightarrow\) 1 \(\rightarrow\) 3 L2 = {6, 10, 3, 8, 9, 4, 7, 2} L2 \(\rightarrow\) 6 \(\rightarrow\) 10 \(\rightarrow\) 3 \(\rightarrow\) 8 \(\rightarrow\) 9 \(\rightarrow\) 4 \(\rightarrow\) 7 \(\rightarrow\) 2 Figure 1 (a) Find L3 which is the intersection of L1 and L2, that is, L3 = L1 \(\cap\) L2. The intersection will find common elements between the two sets. In other words, the elements of the set that appeared in one linked list must also appear in the other linked list. (b) Show the operation of creating L3 through coding. The declaration is void intersection(Node* &L3, Node* L1, Node* L2).

          1. Given the two linked lists L1 and L2 below, answer the related questions below.
L1 = {5, 9, 1, 3}
L1 \(\rightarrow\) 5 \(\rightarrow\) 9 \(\rightarrow\) 1 \(\rightarrow\) 3
L2 = {6, 10, 3, 8, 9, 4, 7, 2}
L2 \(\rightarrow\) 6 \(\rightarrow\) 10 \(\rightarrow\) 3 \(\rightarrow\) 8 \(\rightarrow\) 9 \(\rightarrow\) 4 \(\rightarrow\) 7 \(\rightarrow\) 2
Figure 1
(a) Find L3 which is the intersection of L1 and L2, that is, L3 = L1 \(\cap\) L2. The intersection will find
common elements between the two sets. In other words, the elements of the set that
appeared in one linked list must also appear in the other linked list.
(b) Show the operation of creating L3 through coding. The declaration is
void intersection(Node* &L3, Node* L1, Node* L2).

1. Given the two linked lists L1 and L2 below, answer the related questions below.
L1 = 5, 9, 1, 3
L1 → 5 → 9 → 1 → 3
L2 = 6, 10, 3, 8, 9, 4, 7, 2
L2 → 6 → 10 → 3 → 8 → 9 → 4 → 7 → 2
Figure 1
(a) Find L3 which is the intersection of L1 and L2, that is, L3 = L1 ∩ L2. The intersection will find
common elements between the two sets. In other words, the elements of the set that
appeared in one linked list must also appear in the other linked list.
(b) Show the operation of creating L3 through coding. The declaration is
void intersection(Node* L3, Node* L1, Node* L2).

Added by Jeremy P.

Question

Please give Ace some feedback