4 steps

• Multiple concurrent reads since multiple nodes have same parent
• If CR, then O(lg d), d = maximum depth of trees
  O(lg d) = O(lg lg n) for balanced trees.
• If ER, then the number of nodes that contain the correct root at most doubles each iteration, thus .