Skip to content

DyckPath from BinaryTree ​

A binary tree [L, R] as the Dyck path U φ(L) D φ(R).

BinaryTree → DyckPathinverse

FindStat's Mp00012. A bijection, so every Dyck path statistic answers on a tree; not order-preserving between BinaryTrees and DyckPaths, which list in different orders.

Called as CombinatorialMap(x, "DyckPath"). The head's page has its examples.

Live

Explore

Each element of BinaryTree at a size, and its image, applied in your browser; sizes past 6 are not offered.

Properties

Transport a statistic

Pick a statistic on DyckPath. Its distribution over the images of BinaryTree at each size is computed, and compared with the 37 statistics on BinaryTree: those that share it are the ones the map sends it to, as far as the sizes computed show.

Also from

The same name out of other carriers, each its own implementation: OrderedTree.

FindStat Mp00012

to Dyck path: up step, left tree, down step, right tree

Matched by value: our map agrees with FindStat's image on each of the 196 rows of size at most 6 we can read (0 unread; its table has 1200 rows).

BijectionGraded mapas FindStat records them, checked by FindStat's contributors.

Return the associated Dyck path, using the bijection ''1L0R''.
ObjectImage
[.,.][1,0]
[.,[.,.]][1,0,1,0]
[[.,.],.][1,1,0,0]
[.,[.,[.,.]]][1,0,1,0,1,0]

Data from FindStat, the combinatorial statistic finder; the page at findstat.org/Mp00012 has the rest.