DyckWord.ofTree

BinaryTree Unit → DyckWord

Convert a binary rooted tree to a Dyck word. g(nil) = 0. A nonempty tree with left subtree l and right subtree r is sent to g(l).nest + g(r).

Defined in: Mathlib.Combinatorics.Enumerative.DyckWord
Cited by: 5 results in Mathlib
Foundations: Depth 71 from the axioms · uses propext, Classical.choice, Quot.sound

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Results whose statement or proof uses this declaration.