Is the process of checking for element presence in the DOM tree implemented using recursive calls or loops?

Checking whether a point is inside a DOM element is usually implemented using recursive calls. This is because the DOM is a hierarchical structure where elements can contain nested child elements. Recursion allows traversing all levels of nesting, checking the coordinates of the point relative to each element and its descendants.

For example, during touch or click event processing, the system can recursively descend through the tree, checking if the point is within the current element's boundaries, and if so, proceed to its child elements for a more precise determination of the target element.

In some cases, loops or iterative traversals may be used for optimization, but a recursive approach is more natural for working with trees.