findKey searches for a key inside the tree. Once the key is found, the parent node and the correct index are returned so the key itself can be accessed in the following way parent[index]. A list of the node ancestors (not including the node itself) is also returned. If the key isn't found, we have 2
(key []byte, exact bool)
source not stored for this graph (policy: none)
no test coverage detected