#🔒 BST vs Linear Traversal Implementation

6 messages · Page 1 of 1 (latest)

glossy sonnet
#

My code is meant to compare the effectiveness of BST vs Linear traversal methods but it isnt working as intended 😦

split rivetBOT
#

@glossy sonnet

Python help channel opened

Remember to:

  • Ask your Python question, not if you can ask or if there's an expert who can help.
  • Show a code sample as text (rather than a screenshot) and the error message, if you've got one.
  • Explain what you expect to happen and what actually happens.

:warning: Do not pip install anything that isn't related to your question, especially if asked to over DMs.

Closes after a period of inactivity, or when you send !close.
glossy sonnet
#

so it takes a desired value, and searches for it while print eachvalue that it comes across on the way to given desired value. In this case the program's output is saying it is traversing the same amount of nodes to get to the desired value when the sample data given says the BST search is meant to be much shorter

split rivetBOT
#

@glossy sonnet

Python help channel closed

This help channel has been closed and it's no longer possible to send messages here. If your question wasn't answered, feel free to create a new post in #1035199133436354600. To maximize your chances of getting a response, check out this guide on asking good questions.