Now that we have gone through XOR distances, we will take a look at how a node saves other nodes' addresses. A node does not save all other nodes in a distributed hash table. The number of nodes a node can save depends on the number of bits in a node and the k configuration number. Let's discuss these one by one.
Remember the tree picture we saw previously? It has 16 leaves. Now imagine the smallest tree:
It has two leaves. Let's double the tree:
The tree now has four leaves. Let's double it again:
The tree now has eight leaves. If ...