Arrangements and Combinations · Catalan Numbers: Introduction
Lesson 10
Problem. Let \(B(n)\) denote the number of full binary rooted trees with exactly \(n\) leaves. For example, \(B(4)=5\):
1 point
Arrangements and Combinations · Catalan Numbers: Introduction
Problem. Let \(B(n)\) denote the number of full binary rooted trees with exactly \(n\) leaves. For example, \(B(4)=5\):