search

andey-robins / hashproject

Final Project for COSC 2030 at the University of Wyoming
Apache License 2.0
2 stars 2 forks source link

Recursively Update Hash Elements #4

Closed andey-robins closed 5 years ago

andey-robins commented 5 years ago

When a node has been changed, using the index of that node, move up through the tree to update all of the nodes on the way.

Build the function using the tag int update(vector<DataEntry> & data, int index)

The function should return the index of the parent node of the node referenced by the index passed by the function. The exit condition is when the index = 0 (when the root has been reached).

Call the functions to set the RHASH, LHASH, RHIST, and LHIST vectors within the DataEntry stored at data[index]

andey-robins commented 5 years ago

The tag has been changed, but the functionality is present in PR #10

Closing this issue for now. Open a new issue if some problem is found in the backtracking at scale.