Ah, yes, duplicate keys (sigh!). It probably makes sense to assume that the keys are unique, as this would be the case in most database applications. In practice, the most realistic way to deal with t
David Sha
David Sha
dasha@student.unimelb.edu.au
Caitlin Alberti
Caitlin Alberti
calberti@student.unimelb.edu.au
Tristan Gao
Tristan Gao
trgao@student.unimelb.edu.au
yongenf@student.unimelb.edu.au
yongenf@student.unimelb.edu.au
yongenf@student.unimelb.edu.au
Lee Naish
Lee Naish
dr.lee.naish@gmail.com
achunduri@student.unimelb.edu.au
achunduri@student.unimelb.edu.au
achunduri@student.unimelb.edu.au
Risa Pais
Risa Pais
risapais@gmail.com
Linda Stern
Linda Stern
stern@unimelb.edu.au
It probably makes sense to assume that the keys are unique, as this would be the case in most database applications.
In practice, the most realistic way to deal with this would be to do an equality check and return an error if there is an attempt to insert a duplicate key.
The two options for you as a group at this point would be:
1. Add in an equality check, and return an error if there is an attempt to insert a key that is already in the tree, or
2. Assume there are no duplicates, and we will mention this assumption in the Overview.
The first option Is slightly preferable, but it involves a slight change in the pseudocode, and we are also a bit reluctant to burden you with changes at this late stage. If you’re OK with it, go ahead and do the equality check in the pseudocode and the animation, and send us a copy of the new pseudocode for our records, please. Otherwise, just go with assuming there are no duplicates, and please remind us to augment the Overview.
Thanks,
Linda
Yes the developed graph package can be used for future developments. In fact, it's what we use for both Union-Find and 2-3-4 Trees. The developed graph package is just three additional files (NAryTree.js, NAryTreeVariable.js and NTreeTracer.js) located in github.com/d4vid.../Graph.
We also wanted to ask two questions and might be more related for Lee here:
• (The easy one) We've updated our requirements section following feedback from Leon, and ideally need another verbal approval. We've only made changes to the functional requirements section, so we'd appreciate a written confirmation when you get the chance that it all looks good. I've linked the relevant Notion page here tin-perch-fda.notion.site/Project-Requirements-90caf676f1d541bca7474e072c2b1b86?pvs=4.
• We would also like to ask for clarification on how to deal with duplicate values in the 2-3-4 trees, i.e. if a new value to be inserted already exists in the tree, how should it be dealt with? With the current pseudocode, it is our understanding that duplicate values will still be inserted into the tree (as there is no equality checking), so we wanted to check if this is the case, or if duplicate values should be ignored instead (which will need new pseudocode for it to be reflected accurately), or enforce unique values at the user end.
Kind regards,
David
I was particularly impressed that your group found and used the John Q. Walker node-positioning algorithm for
generalized trees.
When we meet for the Handover Meeting, I’d be interested in a quick run-through of what you felt were the advantages of this algorithm, and if you have any thoughts about where you see it might be used to advantage elsewhere in AIA. I believe you mentioned that you had developed a package for this algorithm, and I was wondering whether this means your code could easily be included in future developments.
Thanks, and well done,
Linda
And finally, remember to send through an updated overview so we can add it to the background page, thanks!
And finally, remember to send through an updated overview so we can add it to the background page, thanks!