refactored BST: insert, delete, inorder + wrapper & tests #373

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Open

xoxo444 wants to merge 1 commit into ndleah:main from xoxo444:patch-2

xoxo444 commented Jul 24, 2025

Cleaned up BST implementation:

Replaced add/remove with insert/delete
Added inorder traversal and str()
Wrapped logic in the Binary Search Tree class
Added test block for demo

Let me know if you'd like further changes


          bst.py

f7035ee

Author

xoxo444 commented Jul 24, 2025

refactored the BST code for clarity and modularity:

replaced old insert/delete logic
added inorder traversal and str()
wrapped in a BinarySearchTree class
included a test block

thanks

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet