Lame JS puzzle #3

fb_find_me_a_node.js

/*
  This is just a BFS. It only works if the node to find is unique (ie: has an ID)
*/

function findNode(curr, node) {
	if (curr == null)
  	return;

  if (curr.isEqualNode(node))
  	return curr;
  
  for (let n of curr.childNodes) {
    let foundNode = findNode(n, node);
    
  	if (foundNode != null)
    	return foundNode;
  }
}

let waldo = document.querySelectorAll('.waldo');
let root = document.querySelector('body')

console.log(findNode(root, waldo))