I'm coding up a search_key algorithm for a binary search tree and am having issues. I'm traversing the binary search tree and comparing the nodes using an in-order traversal algorithm using the basic recursion technique. However, when the conditional hits (search_key == node[x]->value) and I return the node, it seems as if it still continues executing code even after I return the node and it affects the final output. Does the recursion stack continue even if it hits a return value? Is there a way to fix this?