Although that would be functionally equivalent and much simpler, it would also be more expensive computationally: findChild recurses all the way down to a leaf of the tree, whereas the algorithm implemented above only looks one level down.