Comments by "Benjamin Rood" (@benisrood) on "Spanning Tree" channel.

@andrewholden1501 Hi Andrew, given that there are hundreds of keys in the block-size node, the algorithm must also use binary search to look for the position of a matching key, then, right? It would need to look at the min and max keys in the node and if the desired key fell between them it would partition the set and examine the min & max recursively until it found the matching key itself or the branch path to traverse down.
1