A search tree structure should be created in Python that can be used by any type of search algorithm. For this task the depth of the search tree must be dynamic and should only be limited by memory constraints.

Any process or method may be used to create the search tree. The recommended approach is to use a Python Class to represent nodes in a tree. Each of the nodes are linked and a recursive function can be used to build the tree.

An example code segment to create a tree class is provided in Listing 1, and a tree can be constructed using the code in Listing 2, resulting in the node tree shown in Figure 1. 1) Suggestion: A depth parameter may be passed to the constructor of the tree to allow the tree up to be constructed to the specified depth

Listing 1: An example code segment showing the class for a tree l class node (object): 2def _init _(self object, children-) self. object = object self.children children Listing 2: Code showing how to create a tree using the class shown in Listing 1. 1tree node("Start", [ 2 node ("R" node ("R") node ("P" node ("S"] 6node("P" node ("R") node ("P" node ("S"] 10 node("S", 12 13 14 node ("R") node ("P" node ("S")1 Fig. 1: The tree generated by the code in Listing 2 Listing 1: An example code segment showing the class for a tree l class node (object): 2def _init _(self object, children-) self. object = object self.children children Listing 2: Code showing how to create a tree using the class shown in Listing 1. 1tree node("Start", [ 2 node ("R" node ("R") node ("P" node ("S"] 6node("P" node ("R") node ("P" node ("S"] 10 node("S", 12 13 14 node ("R") node ("P" node ("S")1 Fig. 1: The tree generated by the code in Listing 2