Repository navigation
Update tree traversal design doc - #3269
Merged
Merged
Conversation
Describe the serial and parallel traversal orders by four axes (expansion, batching, parent order, sibling order), with the output of every combination on an example tree, the combinator that gives it, and the resources it uses.
harendra-kumar
force-pushed
the
tree-traversal-doc
branch
from
October 27, 2026 23:47
3248dd9 to
da441b8
Compare
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Describe the serial and parallel traversal orders by four axes (expansion, batching, parent order, sibling order), with the output of every combination on an example tree, the combinator that gives it, and the resources it uses. Add read-ahead, iterative deepening and a naming scheme based on the axes.