im wrote the following program to perform a depth-first search (DFS) in a binary tree struct Node int value: Node parent: Node left_child: Noderight_child: bool visited; 1: Node dfs (Node node, int target) printf("%d ", node->visited node->value); true ; if (node-value target) return node: Node * nodes [3] {node->right-child, node->parent, node->left_child) = for (int i = 0: i visited) { return result: return NULL