Theorems · Definition · combinatorics
BinaryTree.numNodes
{α : Type u} → BinaryTree α → ℕThe number of internal nodes (i.e. not including leaves) of a binary tree
- Defined in
- Mathlib.Data.Tree.Basic
- Cited by
- 11 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 by12
Results whose statement or proof uses this declaration.
- BinaryTree.numLeaves_eq_numNodes_succstatement and proof · cited by 1
- BinaryTree.treesOfNumNodesEq_card_eq_catalanproof · cited by 1
- DyckWord.numNodes_toTreestatement and proof · cited by 1
- BinaryTree.mem_treesOfNumNodesEqstatement and proof · cited by 1
- BinaryTree.numLeaves_posproof · cited by 0
- Ordnode.size_toOrdNodestatement and proof · cited by 0
- BinaryTree.coe_treesOfNumNodesEqstatement and proof · cited by 0
- Tree.numNodesproof · cited by 0
- BinaryTree.height_le_numNodesstatement · cited by 0
- BinaryTree.numNodes.eq_defstatement and proof · cited by 0
- BinaryTree.mem_treesOfNumNodesEq_numNodesstatement · cited by 0
- DyckWord.semilength_eq_numNodes_equivTreestatement · cited by 0