findKeyInNode iterates all the items and finds the key. If the key is found, then the item is returned. If the key isn't found then return the index where it should have been (the first index that key is greater than it's previous)
(key []byte)
source not stored for this graph (policy: none)