Expected Steps to Remove a Random Subtree Tree

You are given a rooted tree with $n$ nodes. At each step, you pick one of the remaining non-root nodes uniformly at random and remove it along with its entire subtree. You repeat this process until only the root remains. Find the expected number of steps to clear the tree.