Prepare the following two classes: (i) Define a class Node with attribute: data, left_node and right_node. (ii) Define a class Path with a searchPath function to to find a path from data="Start" to...

b->d->End. а) Start b d End Figure 2 "/>
Extracted text: Prepare the following two classes: (i) Define a class Node with attribute: data, left_node and right_node. (ii) Define a class Path with a searchPath function to to find a path from data="Start" to data="End" as show in the Figure 2. It will return the path from Start to End such as Start->b->d->End. а) Start b d End Figure 2