23. Full Binary Tree Definition
The chapter discusses important concepts related to combinatorial structures such as full binary trees, paths in a grid, diagonals in convex polygons, triangulations, and derangements. It emphasizes the relationships between these structures and the nth Catalan number, illustrating how they can be derived or counted using various mathematical techniques, including bijections and recurrence relations.
Enroll to start learning
You've not yet enrolled in this course. Please enroll for free to listen to audio lessons, classroom podcasts and take practice test.
Sections
Navigate through the learning materials and practice exercises.
What we have learnt
- A full binary tree is defined as a binary tree where every internal node has either 0 or 2 children, and the number of such trees relates to Catalan numbers.
- The number of valid paths on a square grid from (0, 0) to (n, n) can be established using a bijection between paths and strings consisting of 'R' and 'T' movements.
- The number of diagonals in a convex polygon can be computed directly by considering the vertices involved, leading to the formula for the number of diagonals.
Key Concepts
- -- Full Binary Tree
- A binary tree where every internal node has either 0 or 2 children.
- -- Catalan Number
- A sequence of natural numbers that occur in various counting problems, often involving recursively defined objects.
- -- Derangement
- A permutation of a set where none of the elements appear in their original position.
Additional Learning Materials
Supplementary resources to enhance your learning experience.