Data structureintro
Cartesian tree
Also called Cartesian tree of an array.
Binary tree whose inorder traversal is the array and which is heap-ordered by value.
Binary tree whose inorder traversal is the array and which is heap-ordered by value.
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 3X8X1H Edit this page History Report an error