Find a Node in a DOM Tree (DFS/BFS)

Challenge summary

Find a target node inside a DOM-like tree while respecting identity and traversal order.

What you'll practice

• Compare nodes by identity rather than by copied content.
• Traverse nested descendants in a deterministic order.
• Return a stable empty result when the target is absent.

What Premium unlocks

Premium unlocks the runnable workspace, behavioral checks, implementation walkthrough, and edge-case discussion.