Interactive simulator for the directory-tree walker with palindrome-based descent patterns.
How The Walker Works
Type any name (not -) to create a new subdirectory under the node you're currently on, then move into it. Type - to take one step of a tree walk:
Fresh climb: Right after creating a node, pressing - climbs uninterrupted all the way up to the root, restoring the direction the walker was going prior to the node's creation (parent_going_up).
Palindrome descent: From the next genuine arrival at a parent, children are visited in palindrome order — the oldest child sits at the center, every newer child wraps symmetrically. For children [a,b]: b a b. For [a,b,c]: c b c a c b c.
Bounce: Climbing past the root bounces straight back down into it using the same palindrome logic.
parent_going_up: When a node is created while descending, the walker remembers that and advances the parent's pattern pointer on the fresh climb back, so the new child is accounted for in the tour bounds.
The Adapter (Database) stores path strings and assigns numeric IDs. The Walker Engine builds a tree using these IDs. Output maps IDs back to real paths!
Interactive Playground
System initialized. Type a name to create a node, or '-' to walk back.