The node joins the network using a given node, which helps it to attach itself at the correct location.
The code prints finger table entries for its i sucessors at least at a location 2 ^ (i-1) , where 1 <= i <= m, on the Chord ring.
The successor's suitable keys, if any present, are transferred to the newly attached node.
A key can be searched on a random node, even if the key isn't present locally on that node.