Why Floyd’s Algo may not be better!!!

Consider locality of reference:

In Floyd’s algo, subtree rooted at I does not share a single element with subtree rooted at I-I-1. So it displays poor temporal locality.
In repeated adds, there is a 50% chance that new element and previous element have the same parent, 75% that they have same grandfather and so on...