Using A Closure To Encapsulate Depth-First Tree Traversal In Lucee CFML 5.3.3.62

(Ben Nadel) In my last couple of Lucee CFML posts, I’ve looked at using a while loop to recursively iterate over a tree structure without creating a deep (and expensive) call-stack. I’ve done this using both a breadth-first algorithm and a depth-first algorithm.

Register to Read