Theorems · Definition · combinatorics
BinaryTree.numLeaves
{α : Type u} → BinaryTree α → ℕThe number of leaves of a binary tree
- Defined in
- Mathlib.Data.Tree.Basic
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 9 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- BinaryTreestatement and proof · cited by 41
- BinaryTree.brecOnproof · cited by 3
Cited by4
Results whose statement or proof uses this declaration.
- BinaryTree.numLeaves_eq_numNodes_succstatement and proof · cited by 1
- BinaryTree.numLeaves_posstatement · cited by 0
- BinaryTree.numLeaves.eq_defstatement and proof · cited by 0
- Tree.numLeavesproof · cited by 0