adds current error in Readme
changes struct node to struct aggregationTreeNode
finally controls back so do not create more than NN nodes in a tree
modifies structure
changes print functions, making it easy to read
reason why it might be OK to have more nodes
uses dfs-post order making printTree function independent of queue; uses preprocessor NODES; reomves NN, middle variables
simple sanity check
code cleanup
optimizes code by removing while loop
removes floating point exception error
uses preprocessor for divisor
adds fututre work for optimization
start at creating a commitment tree
updates README
first pass at commitment tree without any segfaults
first pass with little bit of manual testing
uses constatnts instead of preprocessor
style rules
fixes broken linkedlist problem