Formed in 2009, the Archive Team (not to be confused with the archive.org Archive-It Team) is a rogue archivist collective dedicated to saving copies of rapidly dying or deleted websites for the sake of history and digital heritage. The group is 100% composed of volunteers and interested parties, and has expanded into a large amount of related projects for saving online and digital history.
Join GitHub today
GitHub is home to over 50 million developers working together to host and review code, manage projects, and build software together.
Sign upAdd 2-3-4 Tree Structure Algorithms #694
Open
Conversation
|
Hi, thanks for contributing. We don't need that tree input.txt file. You can add a small tree for testing in |
|
@goswami-rahul Thanks for the comment, I will change it and push it again. Thanks |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
I implement the 2-3-4 Tree structure in Python. This is my first time contributing in open source, so be welcome to give me professional comment. Thank you.
This Tree structure was taught to me in C++ and now I have implemented it in Python.
The Folder included a input .txt file, where I randomly write out a tons of number, some are duplicated.
When you run the .py file, you will get result of many unsuccessful insert. This is because of duplicates key insert.
At last, you will also get 2 printed lines. One is the root node's A value. Second the result of search a random choice of number to search.
By searching the root node's A value, you should see "Tree234: search(key): Successfully find the key by searching 1 node"