FAQ: Trees: Python - Tree Implementation III: Pruning

This community-built FAQ covers the “Tree Implementation III: Pruning” exercise from the lesson “Trees: Python”.

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

Computer Science

Complex Data Structures

FAQs on the exercise Tree Implementation III: Pruning

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!

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

Need broader help or resources? Head here.

Looking for motivation to keep learning? Join our wider discussions.

Learn more about how to use this guide.

Found a bug? Report it!

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!

How come we don’t just use the .remove() method from the list class when we want to remove a child node?


You are correct, it has the same functionality. Perhaps the instructor just wanted to include the exercise, for example, as we, as beginners, were invariably asked to code the function max(), even though it is available as a builtin. Perhaps they wanted to leave room for some additional functionality in the future (maybe a log of deleted nodes, I don’t know… )