FAQ: Implementing B-Trees in Python - Insert Part 1: Intro

This community-built FAQ covers the “Insert Part 1: Intro” exercise from the lesson “Implementing B-Trees in Python”.

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

Learn Advanced Algorithms and Data Structures with Python

FAQs on the exercise Insert Part 1: Intro

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!

Hi, I’m having trouble understanding the solution, which is this block of code

 def add_key(self, value):
    for i in range(len(self.keys)):
      if value < self.keys[i]:
        self.keys.insert(i, value)
    else:
      self.keys.append(value)

I thought the else statement has to be at the same indentation as the if statement. So wouldn’t a correct way to implement the above code be:

 def add_key(self, value):
    for i in range(len(self.keys)):
      if value < self.keys[i]:
        self.keys.insert(i, value)
        return
    self.keys.append(value)