Skip to content
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

Rework data storing #3

Open
mrghosti3 opened this issue Jul 2, 2022 · 1 comment
Open

Rework data storing #3

mrghosti3 opened this issue Jul 2, 2022 · 1 comment
Assignees
@mrghosti3
Labels
bug Something isn't working

Comments

@mrghosti3
Copy link
Owner

Rewrite how students are stored to match the given task in README. Students are directly read into the tree, and if hash collission is found, then stored in a linked-list.
@mrghosti3 mrghosti3 self-assigned this Jul 2, 2022
@mrghosti3 mrghosti3 added bug Something isn't working invalid This doesn't seem right labels Jul 2, 2022
@mrghosti3
Copy link
Owner Author

the code must deal with the collisions.

  • one (1) point is given for the correctly implemented project which correctly recognizes the hash collision case but does handle it by just issuing a warning on s duplicate key for a different value.

  • two (2) points are given for the correctly implemented project which correctly recognizes the hash collision case and does handle it by implementing a chain per tree node in a form of an appropriate linked list.

@mrghosti3 mrghosti3 removed the invalid This doesn't seem right label Nov 30, 2023
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@mrghosti3 mrghosti3

Labels
bug Something isn't working
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@mrghosti3