IncreasingBinaryTree
A name from the enumeratio catalogue with no kernel of its own yet; this page carries its crosswalk only.
Catalogued in the enumeratio database; not yet written up here.
IncreasingBinaryTree(...)Catalogued in the enumeratio database; not yet written up here.Typed signatures
| Type | Package | Applies |
|---|---|---|
(integer | list<any>) -> increasing_binary_tree | combinatorics | always |
Maps
Into and out of IncreasingBinaryTree, called as CombinatorialMap(x, "Name"). Properties are the laws we state and what FindStat records.
To IncreasingBinaryTree
- FromPermutationPermutation → IncreasingBinaryTreeThe increasing binary tree built by minimum-splitting recursion: the position of the smallest value roots the tree, everything before it recurses to the left, everything after it to the right.