in reply to Re^3: How might I handle a special tree? (updated)
in thread How might I handle a special tree?

Thanks for ref. I missed that ;-)

Your latest structure example looks nice, but I think it would complicate the search and replace algorithms, more than what BrowserUk said.

I think I'll stay with my AoA proposal, with the first element as the group name (adding a null or "root" element to the original list).

  • Comment on Re^4: How might I handle a special tree?