cleaning up memory for array of keys and the node itself when reaching deepest...
Compare changes
+ 0
− 2
cleaning up memory for array of keys and the node itself when reaching deepest point of branch (previous version exposes user to a double-free condition)