Techniqueresearch
Join-based tree algorithms
Also called join-based balanced tree framework, join algorithm for balanced trees.
A unified way to implement set operations such as union, intersection and difference on many balanced trees using a single join operation.
A unified way to implement set operations such as union, intersection and difference on many balanced trees using a single join operation.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag K1RTAT Edit this page History Report an error