Renaissance Learning content structures can organize skills and lessons as a tree. Given the root of a tree and a target parameter, return the path from the root to the first node whose parameter matches the target.
Traverse children from left to right and use preorder depth-first search. If multiple nodes match, return the path to the first match encountered. If no node matches, return an empty list.
Each node is a dictionary with this structure: {"id": string, "parameter": string, "children": list[node]}. The children list may be empty. The function receives root, which is either a node dictionary or None, and target, a string. Return a list of node IDs from the root through the matching node, or [] when no match exists.
def find_parameter_path(root, target):