FAQ: Depth-First Search: Python - Getting Recursive

This community-built FAQ covers the “Getting Recursive” exercise from the lesson “Depth-First Search: Python”.

Paths and Courses
This exercise can be found in the following Codecademy content:

Computer Science

FAQs on the exercise Getting Recursive

There are currently no frequently asked questions associated with this exercise – that’s where you come in! You can contribute to this section by offering your own questions, answers, or clarifications on this exercise. Ask or answer a question by clicking reply (reply) below.

If you’ve had an “aha” moment about the concepts, formatting, syntax, or anything else with this exercise, consider sharing those insights! Teaching others and answering their questions is one of the best ways to learn and stay sharp.

Join the Discussion. Help a fellow learner on their journey.

Ask or answer a question about this exercise by clicking reply (reply) below!
You can also find further discussion and get answers to your questions over in #get-help.

Agree with a comment or answer? Like (like) to up-vote the contribution!

Need broader help or resources? Head to #get-help and #community:tips-and-resources. If you are wanting feedback or inspiration for a project, check out #project.

Looking for motivation to keep learning? Join our wider discussions in #community

Learn more about how to use this guide.

Found a bug? Report it online, or post in #community:Codecademy-Bug-Reporting

Have a question about your account or billing? Reach out to our customer support team!

None of the above? Find out where to ask other questions here!

Dear all,

Could you explain to me why the code below returns None and not the node we were looking for? If I delete the code marked as comments (i.e. the solution) it works, as I return within the “for loop” the node we were looking for. However, if I just write dfs(children, target) instead of the code marked as comments, it should also return the node we were looking for, shouldn’t it?

from TreeNode import TreeNode, sample_root_node, print_path, print_tree

print_tree(sample_root_node)

print(sample_root_node)

def dfs(root, target):
  if root.value == target:
    return root
    
  for children in root.children:
    dfs(children, target)
    #node_found = dfs(children,target)
    #if node_found is not None:
     # return node_found
    

  return None
   


print(dfs(sample_root_node, "G"))