How to write a simple preorder DOM tree traversal algorithm in jQuery?
I'd like to take the code found here: http://www.jslab.dk/articles/non.recursive.preorder.traversal.part2 // HTML element var root = document.documentElement; recursivePreorder(root); // Recusively find and handle all text nodes function recursivePreorder(node) { // If node is a text node if (node.type == 3) { // Do something with node } // else recurse for each child node else { for(var i=0; i<node.childNodes.length; i++) recursivePreorder(node.childNodes[i]); } } and convert it into clean jQuery. Any idea? I know recursion requires argument.callee since the callbacks in jQuery are anonymous,