now we have a private method that implements this process of finding the root by chasing parent pointers until we get to the point where i is equal to id of i, and if it's not equal, we just move i up one level in the tree, set i equals id of i and return it.