Theorems · Inductive type · combinatorics
BinaryTree
Type u → Type u
A binary tree with values stored in non-leaf nodes.
- Defined in
- Mathlib.Data.Tree.Basic
- Cited by
- 41 results in Mathlib
- Foundations
- Depth 0 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites0
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
Nothing in Mathlib beyond the foundations.
Cited by74
Results whose statement or proof uses this declaration.
- BinaryTree.numNodesstatement and proof · cited by 11
- BinaryTree.treesOfNumNodesEqstatement and proof · cited by 10
- BinaryTree.belowstatement and proof · cited by 8
- BinaryTree.brecOn.gostatement and proof · cited by 8
- BinaryTree.brecOn.eqstatement and proof · cited by 7
- DyckWord.toTreestatement and proof · cited by 7
- BinaryTree.traversestatement and proof · cited by 5
- DyckWord.ofTreestatement and proof · cited by 5
- BinaryTree.mapstatement and proof · cited by 4
- BinaryTree.brecOnstatement and proof · cited by 3
- DyckWord.equivTreesOfNumNodesEqstatement · cited by 3
- BinaryTree.numLeavesstatement and proof · cited by 3